Semi-algebraic decision complexity, the real spectrum, and degree

Journal of Pure and Applied Algebra

Volumn 110, Issue 2, 1996, Pages 131-184

  Lickteig, Thomas ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Decision trees; Degree method; Derivations; Real spectrum; Straight line programs

Indexed keywords

EID: 0030597930     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/0022-4049(95)00105-0     Document Type: Article

References (52)

1. [1] W. Baur, manuscript, Universität Konstanz (1989).
2. [2] W. Baur and V. Strassen, The complexity of partial derivatives, Theoret. Comput. Sci. 22 (1983) 317-330.
3. [3] E. Becker, On the real spectrum of a ring and its applications to semi-algebraic geometry, Bull. Am. Math. Soc. (N. S.) 15 (1986) 19-60.
4. [4] M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th ACM STOC, Boston (1983) 80-86.
5. [5] G. Birkhoff and J.D. Lipson, Heterogeneous algebras, J. Combin. Theory 8 (1970) 115-133.
6. [6] A. Björner and L. Lovász, Linear decision trees, subspace arrangements and Möbius function, preprint (1992).
7. [7] A. Björner, L. Lovász and A. Yao, Linear decision trees: volume estimates and topological bounds, Proc. STOC'92 (1992) 170-177.
8. [8] J. Bochnak, M. Coste and M.-F. Roy, Géométrie algébrique réelle, Ergebnisse der Mathematik und ihrer Grenzgebiete, 3. Folge, Band 12 (Springer, Berlin, 1987).
9. [9] 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 (1989) 1-46.
10. [10] P. Bürgisser, M. Karpinski and T. Lickteig, On randomized semi-algebraic decision complexity, J. Complexity 9 (1993) 231-251.
11. [11] P. Bürgisser and T. Lickteig, Verification complexity of linear prime ideals, J. Pure Appl. Algebra 81 (1992) 247-267.
12. [12] P. Bürgisser, T. Lickteig and M. Shub, Test complexity of generic polynomials, J. Complexity 8 (1992) 203-215.
13. [13] P.M. Cohn, Universal Algebra, Mathematics and its Applications 16 (Reidel, Dordrecht, Holland, 1981).
14. [14] M. Demazure and P. Gabriel, Introduction to algebraic geometry and algebraic groups, Math. Stud. (North Holland, Amsterdam, 1980).
15. [15] G. Grätzer, Universal Algebra (Springer, Berlin, 2nd ed., 1979).
16. [16] D. Grigoriev, M. Karpinski and N. Vorobjov, Lower bounds on testing membership to a polyhedron by algebraic decision trees, Proc. STOC'94, to appear.
17. [17] R. Hartshorne, Algebraic Geometry, Graduate Texts in Mathematics 52 (Springer, Berlin, 1977).
18. [18] J. Heintz, Definability and fast quantifier elimination over algebraically closed fields, Theoret. Comput. Sci. 24 (1983) 239-278.
19. [19] M.D. Hirsch, Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs, Comput. Complexity 1 (1991) 257-268.
20. [20] G. Hotz and J. Sellen, On algebraic computation trees and Betti numbers, Tech. Report No. 10/93, Sonderforschungsbereich 124, Saarbrücken-Kaiserslautern, Germany (1993).
21. [21] E. Kaltofen, B.D. Saunders and M. Singer, Size efficient parallel algebraic circuits for partial derivatives, Tech. Report, Rensselaer Polyt. Institute, Troy, NY (1988).
22. [22] M. Knebusch and C. Scheiderer, Einführung in die reelle Algebra, Vieweg-Studium 63 (Aufbaukurs Mathematik, Vieweg, 1989).
23. [23] E. Kunz, Einführung in die kommutative Algebra und algebraische Geometrie, Vieweg-Studium 46 (Aufbaukurs Mathematik, Vieweg, 1980).
24. [24] T. Lickteig, On semialgebraic decision complexity, Tech. Report TR-90-052 Int. Comp. Science Inst., Berkeley (1990) and Univ. Tübingen, Habilitationsschrift.
25. [25] T. Lickteig, Semi-algebraic decision complexity and approximative complexity, in preparation.
26. [26] S. Linnainmaa, Taylor expansion of the accumulated rounding error, BIT 16 (1976) 146-160.
27. [27] H. Matsumura, Commutative ring theory, Cambridge Studies in Advanced Mathematics 8 (Cambridge Univ. Press, Cambridge, 1986).
28. [28] F. Meyer auf der Heide, A polynomial linear search algorithm for the n-dimensional knapsack problem, J. ACM 31 (1984) 668-676.
29. [29] J. Milnor, On the Betti numbers of real varieties, Proc. Amer. Math. Soc. 15 (1964) 275-280.
30. [30] J.L. Montaǹa, J.E. Morais and L.M. Pardo, Lower bounds for arithmetic networks II: sum of Betti numbers, AAECC 7 (1995), to appear.
31. [31] J.L. Montaña and L.M. Pardo, Lower bounds for arithmetic networks, AAECC 4 (1993) 1-24.
32. [32] J.L. Montaña, L.M. Pardo and T. Recio, The non-scalar model of complexity in computational geometry, in: Proceedings of the symposium "MEGA-90 - Effective Methods in Algebraic Geometry" (1990) Castiglioncello (Livorno, Italy) (Birkhäuser, Base, 1991) 347-361.
33. [33] J. Morgenstern, Complexité linéaire de calcul, Thése, Université de Nice, (1978)
34. [34] J. Morgenstern, How to compute fast a function and all its derivatives, SIGACT News 16 (1985) 60-62.
35. [35] R. Mennicken and E. Wagenführer, Numerische Mathematik 2, rororo Vieweg, Grundkurs Mathematik (1977).
36. [36] A. Prestel, Lectures on formally real fields, Lecture Notes in Mathematics, Vol. 1093 (Springer, Berlin, 1984).
37. [37] A. Prestel, Einführung in die Mathematische Logik und Modelltheorie, Vieweg-Studium 60 (Aufbaukurs Mathematik, Vieweg, 1986).
38. [38] M.-F. Roy, Faisceau structural sur le spectre réel et fonctions de Nash, in: Géométrie algébrique réelle et formes quadratiques, Lecture Notes in Mathematics, Vol. 959 (Springer, Berlin, 1982) 406-432.
39. [39] C.P. Schnorr, An extension of Strassen's degree bound, SIAM J. Comput. 10 (1981) 371-382.
40. [40] A. Schönhage, Approximationstheorie (de Gruyter, Berlin, 1971).
41. [41] A. Schönhage, An elementary proof for Strassen's degree bound, Theoret. Comput. Sci. 3 (1976) 267-272.
42. [42] P. Schuster, Interpolation und Kettenbruchentwicklung, Die Komplexität einiger Berechnungsaufgaben, Dissertation, Universität Zürich (1980).
43. [43] J.M. Steele and A.C.C. Yao, Lower bound for algebraic decision trees, J. Algorithms 3 (1982) 1-8.
44. [44] H.J. Stoß, The complexity of evaluating interpolation polynomials, Theoret. Comput. Sci. 41 (1985) 319-323.
45. [45] V. Strassen, Berechnung und Programm I, Acta Inform, 1 (1973) 320-335.
46. [46] V. Strassen, Die Berechnungskomplexität von elementarsymmetrischen Funktionen und Interpolations-koeffizienten, Num. Math. 20 (1973) 238-251.
47. [47] V. Strassen, The computational complexity of continued fractions, SIAM J. Comput. 12 (1983) 1-27.
48. [48] R. Thom, Sur l'homologie des variétés algébriques réelles, in: S.S. Cairns, ed., Differential and Combinatorial Topology (Princton Univ. Press, Princeton, 1965) 255-265.
49. [49] W. Vogel, On Results on Bézout's Theorem, Lecture Notes, TATA Institute of Fundamental Research, Bombay, No. 74 (1984).
50. [50] A.C.C. Yao, Lower bounds for algebraic computation trees with integer inputs, SIAM J. Comput. 20 (1989) 655-668.
51. [51] A.C.C. Yao, Algebraic decision trees and Euler characteristics, Proc. FOCS'92 (1992) 268-277.
52. [52] A.C.C. Yao, Decision trees and Betti numbers, Proc. STOC'94 (1994), to appear.