A Weak Version of the Blum, Shub & Smale Model (1994)

Cached

Download Links

by Pascal Koiran
Citations:29 - 6 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
27 Computing over the reals with addition and order – P Koiran - 1994
3843 Introduction to Automata Theory, Languages, and Computation (2nd Edition – R M J E Hopcroft, J Ullman - 2000
13 A note on a P 6=NP result for a restricted class of real machines – K Meer - 1992
351 Complexity and Real Computations – V Y Pan Blum, L Cucker, F Shub, M Smale, S - 1997
73 Recursion Theory on the Reals and Continuous-time Computation – Cristopher Moore - 1995
68 Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems – Michael S. Branicky - 1995
32 On some Relations between Dynamical Systems and Transition Systems – Eugene Asarin, Oded Maler - 1994
156 On The Computational Power Of Neural Nets – Hava T. Siegelmann, Eduardo D. Sontag - 1995
87 Analog Computation via Neural Networks – Hava T. Siegelmann, Eduardo D. Sontag - 1994
24 Computing over the reals with addition and order: Higher complexity classes – Felipe Cucker, Pascal Koiran Dimacs - 1995
2350 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
26 A survey on real structural complexity theory – C. Michaux - 1997
111 Reachability Analysis of Dynamical Systems having Piecewise-Constant Derivatives – Eugene Asarin, Oded Maler, Amir Pnueli - 1995
29 Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy – Eugene Asarin, Oded Maler - 1995
60 Bounds for the Computational Power and Learning Complexity of Analog Neural Nets – Wolfgang Maass - 1993
3 On the computational power of hybrid and dynamical systems – Olivier Bournez, Michel Cosnard - 1996
13 Classical Recursion Theory, volume 125 of Studies in Logic – Odifreddi P Odifreddi - 1989
97 On relating time and space to size and depth – Allan Borodin - 1977