Some aspects of studying an optimization or decision problem in different computational models (original) (raw)
Related papers
An Algebraic Theory of Complexity for Discrete Optimization
SIAM Journal on Computing, 2013
An algebraic theory of complexity for discrete optimisation
On the complexity of quadratic programming in real number models of computation
Theoretical Computer Science, 1994
1997
Lecture Notes on Computational Complexity
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions
2009
Bulletin of the American Mathematical Society, 1989
Notes on Computational Complexity Theory CPSC 468/568: Spring 2017
Computability and Complexity of Polynomial Optimization Problems
Lecture Notes in Economics and Mathematical Systems, 1992
Model-Theoretic Characterization of Complexity Classes
2009
Algebraic Characterization of Complexity Classes of Computable Real Functions
lix.polytechnique.fr
Steve Smale, Michael Shub, Lenore Blum
Foundations of Computer Science, …, 1988
Abstract Some Results in Computational Complexity
2008
An algebraic theory of complexity for valued constraints: Establishing a Galois connection
Mathematical Foundations of Computer Science 2011, 2011
Real Computation and Complexity Dagstuhl Seminar
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
Corr, 2003
Time-Space Tradeoffs in Algebraic Complexity Theory
Journal of Complexity, 2000
Complexity and Real Computation: A Manifesto
International Journal of Bifurcation and Chaos, 1996
A survey of techniques in applied computational complexity
Journal of Computational and Applied Mathematics, 1975
Some lower bounds for the complexity of the linear programming feasibility problem over the reals
Journal of Complexity, 2009
Complexity theory on real numbers and functions
Lecture Notes in Computer Science, 1982
An Overview of the Theory of Computational Complexity
Journal of the ACM, 1971
Saturation and stability in the theory of computation over the reals
Annals of Pure and Applied Logic, 1999
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets
Foundations of Computational …, 2005
On the Relations Between Discrete and Continuous Complexity Theory
Mathematical Logic Quarterly, 1995
Characterizing Polynomial Time Computability of Rational and Real Functions
Proc. of the 5th International Workshop on De- velopments in Computational Models 2009, 2009
On the computational structure of the connected components of a hard problem
Information Processing Letters, 1999
Theory and Applications of Models of Computation
Lecture Notes in Computer Science, 2013