A survey on real structural complexity theory

Bulletin of the Belgian Mathematical Society - Simon Stevin

Volumn 4, Issue 1, 1997, Pages 113-148

  Meer, Klaus ^a   Michaux, Christian ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF MONS   (Belgium)

Author keywords

Algorithms over general structures; Complexity classes; Real number models; Recursion theory

Indexed keywords

EID: 0038967500     PISSN: 13701444     EISSN: None     Source Type: Journal    
DOI: 10.36045/bbms/1105730626     Document Type: Article

References (136)

1. th Structure in Complexity Theory conference (1992) 207-220.
2. I.V. Ashaev, V.Y. Belyaev, A.G. Myasnikov, Towards a generalized computability theory, Algebra Logic 32, 4 (1993) 183-205; translation form Algebra Logika 32, 4 (1993) 349-386.
3. I.V. Ashaev, V.Y. Belyaev, A.G. Myasnikov, Towards a generalized computability theory, Algebra Logic 32, 4 (1993) 183-205; translation form Algebra Logika 32, 4 (1993) 349-386.
4. J.L. Balcázar, J. Diaz, J. Gabarró, Structural Complexity I,II, EATCS Monographs of Theoretical Computer Science 11 and 22 Springer-Verlag (1988, 1990).
5. V.Y. Belyaev, A.G. Myasnikov, Theorems on hierarchy in generalized recursion theory, preprint, Omsk State University (1992).
6. M. Ben-Or, Lower bounds for algebraic computation trees, in : Proceedings 15th ACM STOC (1983) 80-86.
7. E. Bishop, Machines and Complexity over the p-adic Numbers, PhD-thesis, University of Berkeley (1991).
8. L. Blum, A Theory of Computation and Complexity over the real numbers, Proceedings of the International Congress of Mathematicians Kyoto 1990 II, Math. Soc. Japan, Tokyo, Springer Verlag (1991) 1491-1507.
9. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and real computation, forthcoming book, Springer Verlag.
10. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and real Computation : A Manifesto, Int. J. of Bifurcation and Chaos 6, 1 (1996) 3-26.
11. L. Blum, F. Cucker, M. Shub, S. Smale, Algebraic settings for the problem "P ≠ NP", Proceedings of the 25th AMS-SIAM Summer Seminar in Applied Mathematics, Park City 1995, ed.: J. Renegar, M. Shub, S. Smale.
12. L. Blum, S. Smale, The Gödel Incompleteness Theorem and Decidability over a Ring, in : From Topology to Computation, Proceedings of the Smalefest, Springer - Verlag (1993) 321-339.
13. L. Blum, M. Shub, 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 (1989) 1-46.
14. V.E. Brimkov, S.S. Danchev, Real Data-Integer Solution Problems within the Blum-Shub-Smale Computational Model, Institute of Mathematics, Bulgarian Academy of Science, Preprint (1995).
15. W.D. Brownawell, Bounds for the degrees in the Nullstellensatz, Annals of Mathematics 126 (1987) 577-591.
16. P. Bürgisser, M. Clausen, A. Shokrollahi, Algebraic Complexity Theory, forthcoming.
17. P. Bürgisser, T. Lickteig, M. Shub, Test Complexity of Generic Polynomials, Journal of Complexity 8 (1992) 203-215.
18. R.E. Byerly, Ordered subrings of the reals in which output sets are recursively enumerable, Proc. Amer. Math. Soc. 118, 2 (1993) 597-601.
19. J. Canny, I. Emiris, An efficient algorithm for the sparse mixed resultant, Proceedings AAECC, Puerto Rico 1993, Lecture Notes in Computer Science 263, Springer Berlin (1993) 89-104.
20. C. Ceola, P. Lecomte, Computability of a map and decidability of its graph in the model of Blum, Shub and Smale, Preprint (1996).
21. C.T. Chong, Positive Reducibility of the Interior of Filled Julia Sets, Journal of Complexity 10 (1994) 437-444.
22. S.A. Cook, The complexity of the theorem proving procedures, Proceedings 3rd ACM STOC (1971) 151-158.
23. M. Cosnard, M. Matamala, On NC-Real Complexity classes for additive circuits and their relations with NC, CRM Barcelona, Preprint 221 (1993).
24. F. Cucker, The arithmetical hierarchy over the real, Journal of Logic and Computation 2, 3 (1992) 375-395.
25. ℝ, Journal of Complexity 8 (1992) 230-238.
26. F. Cucker, On the complexity of quantifier elimination : The structural approach, The Computer Journal 36, 5 (1993) 400-408.
27. F. Cucker, D.Y. Grigoriev, On the power of real turing machines over binary inputs, to appear in : SIAM Journal on Computing.
28. th Symposium on Theory of Computing (1995) 335-342.
29. F. Cucker, P. Koiran, Computing over the reals with addition and order. Higher complexity classes, Journal of Complexity 11, 3 (1995) 358-376.
30. 6.
31. F. Cucker, M. Matamala, On weak non-determinism, to appear in : Math. Systems Theory.
32. F. Cucker, K. Meer, Logics which capture complexity classes over the reals, Preprint (1996).
33. F. Cucker, J.L. Montaña, L.M. Pardo, Time Bounded Computations over the Reals, Int. Journal of Algebra and Computation 2, 4 (1992) 395-408.
34. F. Cucker, J.L. Montaña, L.M. Pardo, Models for parallel computation with real numbers, in: Number-theoretic and algebraic methods in computer science, Moscow 1993, World Sci. Publishing, River Edge, NJ (1995) 53-63
35. F. Cucker, F. Rossello, On the complexity of some problems for the Blum-Shub-Smale model, Proc. LATIN'92, Lecture Notes in Computer Science 583 (1992) 117-129.
36. F. Cucker, M. Shub, Generalized Knapsack problems and fixed degree separation, Theoretical Computer Science 161 (1996) 301-306.
37. F. Cucker, M. Shub, S. Smale, Separation of complexity classes in Koiran's weak model, Theoretical Computer Science 133 (1994) 3-14.
38. F. Cucker, A. Torrecillas, Two P-complete problems in the theory of the reals, in : Automata, Languages and Programming, Proceedings of the 18th International Colloquium, Madrid, Spain, July 8-12, 1991, J. Leach Albert, B. Monien, M. Rodriguez Artalejo (Eds.) (1991).
39. J.H. Davenport, J Heintz, Real quantifier elimination is doubly exponential, Journal of Symbolic Computation 5 (1988) 29-35.
40. T. Emerson, Relativization of the P=?NP question over the reals (and other ordered rings), Theoretical Computer Science 133 (1994) 15-22.
41. B.C. Eaves, U.G. Rothblum, A theory on extending algorithms for parametric problems, Mathematics of Operations Research 14, 3 (1989) 502-533.
42. B.C. Eaves, U.G. Rothblum, Dines - Fourier - Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields, Mathematical Programming 53 (1992) 307-321.
43. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, SIAM-AMS Proceedings 7 (1974) 43-73.
44. J. Ferrante, C. Rackoff, A Decision Procedure for the First Order Theory of Real Addition with order, SIAM Journal Comput. 4, 1 (1975) 69-76
45. H. Friedman, R. Mansfield, Algorithmic procedures, Trans. A.M.S. 332, 1 (1992) 297-312.
46. J.S. Gakwaya, Extended Grzegorczyk Hierarchy in the BSS-model of Computability, NeuroCOLT TR Series NC-TR-96-49 (1996).
47. M. Garey, D. Johnson, Computers and Intractability, Freeman and Company, New York (1979).
48. C. Gassner, On NP-completeness for Linear Machines, preprint (1996).
49. J.B. Goode, Accessible telephone directories, Jour. of Symb. Logic 59, 1 (1994) 92-105.
50. th AMS-SIAM Summer Seminar in Applied Mathematics, Park City 1995, ed.: J. Renegar, M. Shub, S. Smale .
51. th AMS-SIAM Summer Seminar in Applied Mathematics, Park City 1995, ed.: J. Renegar, M. Shub, S. Smale .
52. D.Y. Grigor'ev, Complexity of Deciding Tarski Algebra, Journal of Symbolic Computation 5 (1988) 65-108.
53. Y. Gurevich, Logic and the challenge of computer science, in: E. Boerger (ed.), Trends in Theoretical Computer Science, Computer Science Press (1988), 1-57.
54. J. Heintz, J. Morgenstern, On the intrinsic Complexity of Elimination Theory, Journal of Complexity 9 (1993) 471-498.
55. J. Heintz, M.F. Roy, P. Solerno, On the complexity of semialgebraic sets, Proceedings IFIP 1989, San Francisco, North-Holland (1989) 293-298.
56. A. Hemmerling, On Genuine Complexity and Kinds of Nondeterminism, J. Inform. Process. Cybernet. EIK 30, 2 (1994) 77-96.
57. A. Hemmerling, Computability and Complexity over Structures of Finite Type, E.M.Arndt-University Greifswald, Preprint 2 (1995).
58. P. Hertling, Topological Complexity for Continuous Operations, to appear in: Journal of Complexity 12, 4 (1996).
59. M.D. Hirsch, Applications of Topology to Lower bound estimates, in : From Topology to Computation, Proceedings of the Smalefest, Springer-Verlag, New-York, Berlin (1993) 395-418.
60. G. Hotz, G. Vierke, B. Schieffer, Analytic Machines, Electronic Colloquium on Computational Complexity 95-025 (1995) available via ftp.eccc.unitrier.de:/pub/eccc/.
61. N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
62. L.G. Khachyan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk USSR 244 (1979) 1093-1096; english translation in: Soviet Math. Dokl. 20 (1979) 191-194.
63. L.G. Khachyan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk USSR 244 (1979) 1093-1096; english translation in: Soviet Math. Dokl. 20 (1979) 191-194.
64. Ker-I Ko, Complexity of real functions, Birkhäuser, Basel-Berlin-Boston (1991).
65. 7.
66. 7.
67. P. Koiran, Puissance de calcul de réseux de neurones artificiels, PhD-thesis, ENS Lyon (1993).
68. P. Koiran, Computing over the reals with addition and order, Theoretical Computer Science 133 (1994) 35-47.
69. P. Koiran, Hubert's Nullstellensatz is in the Polynomial Hierarchy, to appear in: Journal of Complexity 12, 4 (1996).
70. P. Koiran, Elimination of Constants from Machines over Algebraically Closed Fields, NeuroCOLT TR Series NC-TR-96-43 (1996).
71. H. Levine, A lower bound for the topological complexity of Poly(D,n), Journal of Complexity 5 (1991) 34-44.
72. T. Lickteig, On semialgebraic decision complexity, TR-90-052 ICSI, Berkeley und Universität Tübingen, Habilitationsschrift (1990).
73. T. Lickteig, Semi-algebraic Decision Complexity, the Real Spectrum and Degree, Journal of pure and applied algebra 110, 2 (1996) 131-184.
74. T. Lickteig, K. Meer, A note on testing the resultant, Journal of Complexity 11, 3 (1995) 344-351.
75. W. Maass, On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines, Jour. of Symb. Logic 53, 4 (1988) 1098-1109.
76. W. Maass, Computing on Analog Neural Nets with Arbitrary Real Weights, in : Theoretical Advances in Neural Computation and Learning, V.P. Roychowdhury, K.Y. Siu, A. Orlitsky, editors, Kluwer Academic Publishers (Boston) (1994) 153-172.
77. G. Malajovich, On generalized Newton algorithms : quadratic convergence, path-following and error analysis, Theoretical Computer Science 133 (1994) 65-84.
78. ℂ, to appear in: SIAM Journal on Computing.
79. R. Mansfield, A complete axiomatization of computer arithmetic, Math. Comp. 42 (1984) 623-635.
80. R. Mansfield, The irrationals are not recursively enumerable, Proc. Amer. Math. Soc. 110 (1990) 495-497.
81. A.R. Mathias, Comparison of the projective and non-deterministic hierarchies, preprint (1994).
82. K. Meer, Computations over ℤ and ℝ : a comparison, Journal of Complexity 6 (1990) 256-263.
83. K. Meer, A note on a P ≠ NP - result for a restricted class of real machines, Journal of Complexity 8 (1991) 451-453.
84. K. Meer, Komplexitätsbetrachtungen für reelle Maschinenmodelle, PhD-thesis, RWTH Aachen, Verlag Shaker-Aachen, ISBN 3-86111-385-6 (1993).
85. K. Meer, Real number models under various sets of operations, Journal of Complexity 9 (1993) 366-372.
86. K. Meer, On the complexity of Quadratic Programming in real number models of computations, Theoretical Computer Science 133 (1994) 85-94.
87. K. Meer, Real number models : On the use of information, Journal of Symbolic Computation 18 (1994) 199-206.
88. K. Meer, Eine Einführung in die reelle Komplexitätstheorie, Lecture note manuscript, RWTH Aachen (1995).
89. K. Meer, On the relations between discrete and continuous complexity theory, Mathematical Logic Quarterly 41 (1995) 281-286.
90. N. Megiddo, A general NP-completeness Theorem, in : From Topology to Computation, Proceedings of the Smalefest, Springer-Verlag, New-York, Berlin (1993) 432-442.
91. W. de Melo, B. Fux-Svaiter, The cost of computing integers, preprint (1995).
92. F. Meyer auf der Heide, A polynomial search algorithm for the n-dimensional Knapsack problem, Journal of the ACM 31, 3 (1984) 668-676.
93. D. Mercier, Les machines sur ℝ (d'après Blum, Shub and Smale), mémoire de licence, Université de Mons-Hainaut (1989).
94. C. Michaux, Une remarque à propos des machines sur ℝ introduites par Blum, Shub et Smale, C.R. Acad. Sci. Pans 309, série I (1989) 435-437.
95. C. Michaux, Machines sur les réels et problèmes NP-complets (d'après L. Blum, M. Shub, S. Smale et al.), Séminaire des structures algébriques ordonnées 1988-1989, prépublication de l'équipe de Logique Mathématique de Paris 7, 2 (1990) 30 pages.
96. C. Michaux, Ordered rings over which output sets are recursively enumerable, PTOC. Amer. Math. Soc. 112 (1991) 569-575.
97. C. Michaux, Differential fields, Machines over the real numbers and Automata, PhD-thesis, Université de Mons Hainaut, Faculte des Sciences (1991).
98. C. Michaux, P ≠ NP over the nonstandard reals implies P ≠ NP over ℝ, Theoretical Computer Science 133 (1994) 95-104.
99. J.L. Montaña, L.M. Pardo, Lower Bounds for Arithmetic Networks, Applicable Algebra in Engineering, Communication and Computing 4 (1993) 1-24
100. C. Moore, Recursion Theory on the Reals and Continuous-time Computation, Theoretical Computer Science 162, 1 (1996) 23-44.
101. E. Novak, Complexity of continuous problems - an introduction, Lecture note manuscript, University of Erlangen (1993).
102. E. Novak, The real number model in numerical analysis, Journal of Complexity 11 (1995) 57-73.
103. E. Novak, H. Woźniakowski, Topological complexity of zero finding, to appear in: Journal of Complexity 12, 4 (1996).
104. B. Poizat, Les Petits Cailloux, une approche modèle-théorique de l'Algorithmie, Aléas (1995).
105. N. Portier, Résolutions universelles pour des problèmes NP-complets, Prépublications de l'Institut Girard Desargues 22 (1996).
106. J. Renegar, Computational Complexity of Solving Real Algebraic Formulae, Proceedings of the International Congress of Mathematicians Kyoto 1990 I,II, Math. Soc. Japan, Tokyo (1991) 1595-1606.
107. J. Renegar, On the computational Complexity and Geometry of the first-order Theory of the Reals, I - III, Journal of Symbolic Computation 13 (1992) 255-352.
108. R. Saint Jones, Theory of Computation for the Real Numbers and Subrings of the Real Numbers Following Blum/Shub/Smale, Dissertation, University of Berkeley (1995).
109. A. Schönhage, Equations solving in terms of computational complexity, Proceedings of the International Congress of Mathematicians Berkeley 1986 I (1986) 131-153.
110. M. Shub, Some Remarks on Bezout's Theorem and Complexity Theory, in : From Topology to Computation, Proceedings of the Smalefest, Springer-Verlag, New-York, Berlin (1993) 443-455.
111. M. Shub, On the Work of Steve Smale on the Theory of Computation, in : From Topology to Computation, Proceedings of the Smalefest, Springer-Verlag, New-York, Berlin (1993) 281-301.
112. M. Shub, Mysteries of Mathematics and Computation, Mathematical Intelligencer 16, 1 (1994) 10-15.
113. M. Shub, S. Smale, Complexity of Bezout's Theorem I : Geometric aspects, Journal of the AMS 6 (1993) 459-501.
114. M. Shub, S. Smale, On the Intractability of Hubert's Nullstellensatz and an algebraic version of "NP ≠ P?", to appear in : Duke Journal.
115. K. Skandalis, Programmable real numbers and functions, Fundamenta Informaticae 7, 1 (1984) 27-56.
116. K. Skandalis, On the characterization of recursively enumerable sets as pseudodiophantine, Proceedings of the American Mathematical Society 123, 2 (1995) 555-558.
117. S. Smale, On the Topology of Algorithms I, Journal of Complexity 3 (1987) 81-89.
118. S. Smale, Some Remarks on the Foundations of Numerical Analysis, SIAM Review 32, 2 (1990) 211-220.
119. S. Smale, Theory of computation in : Mathematical Research Today and Tomorrow, ed.: M. Castellet et al, LN in Mathematics 1525 (1991) 59-69.
120. E.D. Sontag, Real addition and the polynomial hierarchy, Information Processing Letters 20 (1985) 115-120.
121. E.D. Sontag, H. Siegelmann, Neural Networks with real weights : analog computational complexity, Report SYCON-92-05, Rutgers University (1992).
122. L. Stockmeyer, The polynomial hierarchy, Theoretical Computer Science 3 (1976) 1-22.
123. L. Stockmeyer, Classifying the computational complexity of problems, Jour. of Symb. Logic 52, 1 (1987) 1-43.
124. J.M. Steele, A.C. Yao, Lower Bounds for Algebraic Decision Trees, Journal of Algorithms 3 (1982) 1-8.
125. V. Strassen, Algebraische Berechnungskomplexität, in : Perspectives in Mathematics, Anniversary of Oberwolfach (1984) 509-550.
126. A. Tarski, A decision method for elementary algebra and geometry, 2nd edition, Univ. Calif. Press. Berkeley (1951).
127. J. Traub, On Smale's work in the theory of Computation : From polynomial zeros to Continuous Complexity, in : From Topology to Computation, Proceedings of the Smalefest, Springer-Verlag, New-York, Berlin (1993) 317-320.
128. J. Traub, H. Woźniakowski, Complexity of linear programming, Operations Research Letters 1, 2 (1982) 59-62.
129. E. Triesch, A note on a Theorem of Blum, Shub, and Smale, Journal of Complexity 6 (1990) 166-169.
130. V.A. Vassil'ev, Cohomology of Braid Groups and Complexity, in : From Topology to Computation, Proceedings of the Smalefest, Springer-Verlag, New-York, Berlin (1993) 359-367.
131. S.A. Vavasis, Nonlinear Optimization, Complexity Issues, International Series of Monographs on Computer Science 8, Oxford University Press, New York -Oxford (1991).
132. L. van den Dries, Alfred Tarski's elimination theory for real closed fields, Jour. of Symb. Logic 53, 1 (1988) 7-19.
133. B.L. van der Waerden, Moderne Algebra I / II, Springer Verlag Berlin (1931).
134. S. Vigna, On the relations between distributive computability and the BSS-model, Theoretical Computer Science 162, 1 (1996) 5-21.
135. J. von zur Gathen, Algebraic Complexity Theory, Ann. Review of Computer Science 3 (1988) 317-347.
136. K. Weihrauch, A simple Introduction to Computable Analysis, Informatik-Berichte FernUniversität Hagen 171-2 (1995).