Some Speed-Ups and Speed Limits for Real Algebraic Geometry

Journal of Complexity

Volumn 16, Issue 3, 2000, Pages 552-571

  Rojas, J Maurice ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Semi algebraic; connected components; upper bounds; fewnomials; complexity; NP; BPP; polylogarithmic

Indexed keywords

EID: 0005309206     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.2000.0553     Document Type: Article

References (40)

1. Barna B. Über die Divergenzpunkte des Newtonschen Verfahrens zur Bestimmung von Wurzeln Algebraischer Gleichungen. Publ. Math. Debrecen. 4:1956;384-397.
2. S. Basu, On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets, in Proceedings of the Twenty-Eight Annual ACM STOC, Philadelphia, PA, 1996, pp. 408-417, ACM, New York.
3. Basu S., Pollack R., Roy M.-F. On the combinatorial and algebraic complexity of quantifier elimination. J. Assoc. Comput. Mach. 43:1996;1002-1045.
4. Benedetti R., Loeser F., Risler J. J. Bounding the number of connected components of a real algebraic set. Discr. Comput. Geom. 6:1991;191-209.
5. Bernshtein D. N., Kushnirenko A. G., Khovanski A. G. Newton polyhedra. Uspehi Mat. Nauk. 31:1976;201-202.
6. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1998;Springer-Verlag, Berlin/New York.
7. Burago Yu. D., Zalgaller V. A. Geometric Inequalities. Grundlehren der mathematischen Wissenschaften 285. 1988;Springer-Verlag, Berlin/New York.
8. Cucker F., Karpinski M., Koiran P., Lickteig T., Werther K. On real Turing machines and toss coins. Proceedings of the 27th STOC. 1995;ACM Press, New York. p. 335-342.
9. Cucker F., Koiran P., Smale S. A polynomial time algorithm for diophantine equations in one variable. J. Symbolic Comput. 27:1999;21-29.
10. Danilov V. I., Khovanski A. G. Newton polyhedra and an algorithm for calculating Hodge-Deligne numbers. Math. USSR-Izv. 29:1987;279-298.
11. Dobkin D., Lipton R. On the complexity of computations under varying sets of primitives. J. Comput. System Sci. 18:1979;86-91.
12. Dyer M., Gritzmann P., Hufnagel A. On the complexity of computing mixed volumes. SIAM J. Comput. 27:1998;356-400.
13. Gel'fand I. M., Kapranov M. M., Zelevinsky A. V. Discriminants, Resultants, and Multidimensional Determinants. 1994;Birkhäuser, Boston.
14. M. Giusti, G. Lecerf, and, B. Salvy, A Gröbner-free alternative to polynomial system solving, J. Complexity, to appear.
15. Gritzmann P., Klee V. On the complexity of some basic problems in computational convexity II: Volume and mixed volumes. Polytopes: Abstract, Convex, and Computational, Scarborough, ON, 1993. NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 440:1994;Kluwer Academic, Dordrecht. p. 373-466.
16. Giusti M., Heintz J., Morais J. E., Pardo L. M. When polynomial equation systems can be "solved" fast? Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Paris, 1995. Lecture Notes in Comput. Sci. 948:1995;Springer-Verlag, Berlin. p. 205-231.
17. Hirsch M. Differential Topology. Graduate Texts in Mathematics. 33:1994;Springer-Verlag, New York.
18. Iliopoulos C. S. Worst case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix. SIAM J. Comput. 18:1989;658-669.
19. Khovanski A. Fewnomials. 1991;AMS Press, Providence.
20. Koiran P. DIMACS Technical Report. July 1996.
21. R-complete, Complexity, in press.
22. Lenstra H. W. Finding small degree factors of Lacunary polynomials. Number Theory in Progress (Zakopane-Kóscielisko, 1997). 1999;de Gruyter, Berlin. p. 267-276.
23. Milnor J. On the Betti numbers of real varieties. Proc. Amer. Math. Soc. 15:1964;275-280.
24. B. Mourrain, and, V. Y. Pan, Asymptotic acceleration of solving multivariate polynomial systems of equations, in, Proc. ACM STOC 1998.
25. Mumford D. Algebraic Geometry I: Complex Projective Varieties. Classics in Mathematics. 1995;Springer-Verlag, Berlin.
26. Neff C. A., Reif J. An efficient algorithm for the complex roots problem. J. Complexity. 12:1996;81-115.
27. Oleinik O., Petrovsky I. On the topology of real algebraic hypersurfaces. Izv. Akad. Akad. Nauk SSSR. 13:1949;389-402.
28. Papadimitriou C. H. Computational Complexity. 1995;Addison-Wesley, Reading.
29. Plaisted D. A. New NP-hard and NP-complete polynomial and integer divisibility problems. Theoret. Comput. Sci. 31:1984;125-138.
30. n). Computational Algebraic Geometry, Nice, 1992. Progr. Math. 109:1993;Birkhäuser, Boston. p. 225-233.
31. Rojas J. M. Toric laminations, sparse generalized characteristic polynomials, and a refinement of Hilbert's tenth problem. Cucker F., Shub M. Foundations of Computational Mathematics, Rio de Janeiro, January 1997. 1997;369-381 Springer-Verlag, Berlin/New York.
32. Rojas J. M. Intrinsic near quadratic complexity bounds for real multivariate root counting. Proceedings of the Sixth Annual European Symposium on Algorithms. Lecture Notes on Computer Science. 1461:1998;Springer-Verlag, Berlin/New York. p. 127-138.
33. Rojas J. M. On the complexity of diophantine geometry in low dimensions. Proceedings of the 31st Annual ACM STOC, May 1-4, 1999, Atlanta, Georgia. 1999;ACM Press, New York. p. 527-536.
34. Rojas J. M. Solving degenerate sparse polynomial systems faster. J. Symbolic Comput. 28:1999;155-186.
35. J. M. Rojas, and, Y. Ye, Solving real fewnomials in logarithmic time, submitted for publication, 1999.
36. Smith H. J. S. On systems of integer equations and congruences. Philos. Trans. 151:1861;293-326.
37. Steele J., Yao A. Lower bounds for algebraic decision trees. J. Algorithms. 3:1982;1-8.
38. Sturmfels B. Sparse elimination theory. Eisenbud D., Robbiano L. Proc. Computat. Algebraic Geom. and Commut. Algebra, 1991, Cortona, Italy. 1993;377-396 Cambridge Univ. Press, Cambridge.
39. Thom R. Sur l'homologie des variétés algébriques réelles. Cairns S. Differential and Combinatorial Topology. 1965;Princeton University Press, Princeton.
40. Ye Y. Combining binary search and Newton's method to compute real roots for a class of real functions. J. Complexity. 10:1994;271-280.