|
NeuroCOLT
Technical Report NC-TR-98-010
Discrete
versus analog computation:
Some aspects of studying the same problem in different computational
models
Klaus Meer
RWTH
Aachen
Keywords:
Real number complexity; linear and quadratic programming;
structure of complexity classes; saturation
Received:
25-MAR-1998
Abstract
In this tutorial we want to outline some of the features coming up
when analyzing the same computational problems in different complexity
theoretic frameworks. We will focus on two problems; the first related
to mathematical optimization and the second dealing with the intrinsic
structure of complexity classes. Both examples serve well for working
out in how far different approaches to the same problem on the one
hand side can shed light upon each other, but as well allow to apply
intrinsically different methods focussing on other aspects and thus
sometimes leading to diverse results.
Download Compressed Postscript
|