Verschelde, Jan; Haegemans, Ann Homotopies for solving polynomial systems within a bounded domain. (English) Zbl 0811.65041 Theor. Comput. Sci. 133, No. 1, 165-185 (1994). Reviewer: E.L.Allgower (Fort Collins) MSC: 65H10 65H20 26C10 30C15 12Y05 PDF BibTeX XML Cite \textit{J. Verschelde} and \textit{A. Haegemans}, Theor. Comput. Sci. 133, No. 1, 165--185 (1994; Zbl 0811.65041) Full Text: DOI
Shub, M.; Smale, S. Complexity of Bezout’s theorem. V: Polynomial time. (English) Zbl 0846.65022 Theor. Comput. Sci. 133, No. 1, 141-164 (1994). MSC: 65H10 12Y05 65Y20 30C15 PDF BibTeX XML Cite \textit{M. Shub} and \textit{S. Smale}, Theor. Comput. Sci. 133, No. 1, 141--164 (1994; Zbl 0846.65022) Full Text: DOI
Rojas, J. Maurice A convex geometric approach to counting the roots of a polynomial system. (English) Zbl 0812.65040 Theor. Comput. Sci. 133, No. 1, 105-140 (1994). Reviewer: D.Braess (Bochum) MSC: 65H10 30C15 12Y05 PDF BibTeX XML Cite \textit{J. M. Rojas}, Theor. Comput. Sci. 133, No. 1, 105--140 (1994; Zbl 0812.65040) Full Text: DOI
Michaux, Christian P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\). (English) Zbl 0822.68033 Theor. Comput. Sci. 133, No. 1, 95-104 (1994). MSC: 68Q15 12L15 PDF BibTeX XML Cite \textit{C. Michaux}, Theor. Comput. Sci. 133, No. 1, 95--104 (1994; Zbl 0822.68033) Full Text: DOI
Meer, K. On the complexity of quadratic programming in real number models of computation. (English) Zbl 0811.90082 Theor. Comput. Sci. 133, No. 1, 85-94 (1994). MSC: 90C20 90C60 68Q05 PDF BibTeX XML Cite \textit{K. Meer}, Theor. Comput. Sci. 133, No. 1, 85--94 (1994; Zbl 0811.90082) Full Text: DOI
Malajovich, Gregorio On generalized Newton algorithms: Quadratic convergence, path-following and error analysis. (English) Zbl 0811.65039 Theor. Comput. Sci. 133, No. 1, 65-84 (1994). Reviewer: E.L.Allgower (Fort Collins) MSC: 65H10 65H20 65Y20 12Y05 PDF BibTeX XML Cite \textit{G. Malajovich}, Theor. Comput. Sci. 133, No. 1, 65--84 (1994; Zbl 0811.65039) Full Text: DOI
Kůrka, Petr Regular unimodal systems and factors of finite automata. (English) Zbl 0811.58037 Theor. Comput. Sci. 133, No. 1, 49-64 (1994). MSC: 37B99 68Q45 PDF BibTeX XML Cite \textit{P. Kůrka}, Theor. Comput. Sci. 133, No. 1, 49--64 (1994; Zbl 0811.58037) Full Text: DOI
Koiran, P. Computing over the reals with addition and order. (English) Zbl 0822.68028 Theor. Comput. Sci. 133, No. 1, 35-47 (1994). MSC: 68Q05 68Q25 03D10 PDF BibTeX XML Cite \textit{P. Koiran}, Theor. Comput. Sci. 133, No. 1, 35--47 (1994; Zbl 0822.68028) Full Text: DOI
Grigoriev, D. Yu. Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids. (English) Zbl 0844.05091 Theor. Comput. Sci. 133, No. 1, 23-33 (1994). Reviewer: N.V.Grigorenko (Kiev) MSC: 05C85 68W15 68Q25 34A30 PDF BibTeX XML Cite \textit{D. Yu. Grigoriev}, Theor. Comput. Sci. 133, No. 1, 23--33 (1994; Zbl 0844.05091) Full Text: DOI
Emerson, T. Relativizations of the P=?NP question over the reals (and other ordered rings). (English) Zbl 0819.68054 Theor. Comput. Sci. 133, No. 1, 15-22 (1994). MSC: 68Q15 03D15 93D15 PDF BibTeX XML Cite \textit{T. Emerson}, Theor. Comput. Sci. 133, No. 1, 15--22 (1994; Zbl 0819.68054) Full Text: DOI
Cucker, F.; Shub, M.; Smale, S. Separation of complexity classes in Koiran’s weak model. (English) Zbl 0819.68053 Theor. Comput. Sci. 133, No. 1, 3-14 (1994). MSC: 68Q15 03D15 68Q05 PDF BibTeX XML Cite \textit{F. Cucker} et al., Theor. Comput. Sci. 133, No. 1, 3--14 (1994; Zbl 0819.68053) Full Text: DOI