Complexity and Real Computation: A Manifesto (1995)

Cached

Download Links

by Lenore Blum , Felipe Cucker , Mike Shub , Steve Smale
Venue:International Journal of Bifurcation and Chaos
Citations:11 - 0 self

Documents Related by Co-Citation

382 On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines – L Blum, M Shub, S Smale - 1989
73 Recursion Theory on the Reals and Continuous-time Computation – Cristopher Moore - 1995
26 A survey on real structural complexity theory – C. Michaux - 1997
351 Complexity and Real Computations – V Y Pan Blum, L Cucker, F Shub, M Smale, S - 1997
568 A Decision Method for Elementary Algebra and Geometry – A Tarski - 1948
42 J.I.: Computability in Analysis and Physics – M B Pour-El, Richards - 1989
7 On the complexity of Quadratic Programming in real number models of computations, Theoretical Computer Science 133 – K Meer - 1994
2 On the relations between discrete and continuous complexity theory, Mathematical Logic Quaterly 41 – K Meer - 1995
838 Theory of Recursive Functions and Effective Computability – H Rogers - 1967
4 The complexity of accurate floating point computation – J. Demmel - 2002
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
162 Complexity Theory of Real Functions – K-I Ko - 1991
63 Computation Beyond the Turing Limit – H T Siegelmann - 1995
1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
6 Algebraic Properties of Structures – E Engeler - 1993
23 Some remarks on the foundations of numerical analysis – S Smale - 1990
6 Ordered rings over which output sets are recursively enumerable – C Michaux - 1991
10 den Dries, Alfred Tarski's elimination theory for real closed fields – L van - 1988
6 A simple Introduction to Computable Analysis, Informatik-Berichte FernUniversit"at Hagen – K Weihrauch - 1995