A Weak Version of the Blum, Shub, and Smale Model

Journal of Computer and System Sciences

Volumn 54, Issue 1, 1997, Pages 177-189

  Koiran, Pascal ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FORMAL LANGUAGES; NEURAL NETWORKS; POLYNOMIALS; TURING MACHINES;

BLUM-SHUB-SMALE MODEL; BOOLEAN LANGUAGES;

MATHEMATICAL MODELS;

EID: 0031079278     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1478     Document Type: Article

References (23)

1. J. L. Balcázar, J. Diáz, and J. Gabarró, "Structural Complexity I," EATCS Monographs on Theoretical Computer Science, Springer-Verlag, New York/Berlin, 1988.
2. J. L. Balcázar, J. Diáz, and J. Gabarró, "Structural Complexity II," EATCS Monographs on Theoretical Computer Science, Springer-Verlag, New York/Berlin, 1990.
3. R. Benedetti and J.-J. Risler, "Real Algebraic and Semi-algebraic Sets," Hermann, Paris, 1990.
4. L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21, No. 1 (1989), 1-46.
5. J. Bochnak, M. Coste, and M.-F. Roy, "Géométrie algébrique réelle," Springer-Verlag, New York/Berlin, 1987.
6. J. Bruck and K.-Y. Siu, On the power of threshold circuits with small weights, SIAM J. Discrete Math. 4, No. 3 (1991), 423-435.
7. M. Coste and M.-F. Roy, Thom's lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets, J. Symbolic Comput. 5 (1988), 121-129.
8. ℝ, J. Complexity 8 (1992), 230-238.
9. F. Cucker, L. Gonzalez Vega, and F. Roselló, On algorithms for real algebraic plane curves, in "Effective Methods in Algebraic Geometry," Progress in Mathematics, Vol. 94, pp. 63-87, Birkhäuser, Basel, 1991.
10. F. Cucker, M. Shub, and S. Smale, Separations of complexity classes in Koiran's weak model, Theoret. Comput. Sci. 133, No. 1 (1994), 3-14.
11. J. B. Goode, Accessible telephone directories, J. Symbolic Logic 59, No. 1 (1994), 92-105.
12. C. Kenyon and L. Lóvász, "Algorithmic Discrete Mathematics," Techical Report CS-TR-251-90, Department of Computer Science, Princeton University, March 1990.
13. P. Koiran, A weak version of the Blum, Shub, and Smale model, in "Proc. 34th IEEE Symposium on Foundations of Computer Science, 1993," pp. 486-495.
14. S. Lang, "Algebra," Addison-Wesley, Reading, MA, 1965.
15. R. Loos, Computing in algebraic extensions, in "Computer Algebra, Symbolic and Algebraic Computation" (Buchberger, Collins, and Loos, Eds.), pp. 173-187, Springer-Verlag, New York/Berlin, 1982.
16. W. Maass, Bounds for the computational power and learning complexity of analog neural nets, in "Proc 25th ACM Symposium on Theory of Computing, 1993," pp. 335-344; SIAM J. Comput., to appear.
17. J. Milnor, On the Betti numbers of real varieties, Proc. Amer. Math. Soc. 15 (1964), 275-280.
18. J. Renegar, On the computational complexity and geometry of the first-order theory of the reals, parts I, II, III, J. Symbolic Comput. 13, No. 3 (1992), 255-352.
19. F. Ronga, Recherche de solutions d'inéquations polynômiales, in "Algorithmique, topologie et géométrie algébriques" (C. Hayat-Legrand and F. Sergeraert, Eds.), Astérisque, Vol. 192, pp.11-16, Soc. Math, de France, Paris, 1990.
20. A. Schönhage, On the power of random access machines, in "Proc. 6th ICALP," Lect. Notes in Comput. Sci., Vol. 71, Springer-Verlag, New York/Berlin, 1979.
21. A. Schrijver, "Theory of Linear and Integer Programming, "Wiley, New York, 1986.
22. H. T. Siegelmann and E. D. Sontag, Analog computation via neural networks, Theoret. Comput. Sci. 131, No. 2 (1994), 331-360.
23. S. Smale, Some remarks on the foundations of numerical analysis, SIAM Rev. 32, No. 2 (1990), 211-220.