Abstract
An outline on the relation between algebraic complexity theories and semialgebraic sets is presented. First we discuss the concepts of total and non-scalar complexities both for polynomials and semialgebraic sets observing that they are ”geometric complexities” verifying the ”semialgebraic” version of the Benedetti-Risler conjecture [4]. Moreover, we remark that total and non-scalar complexities of semialgebraic sets are decidable theories. Finally, using non-scalar complexity and intersection numbers of semialgebraic sets we get new lower bounds for several problems in computational geometry, generalizing the results obtained by M. Ben-Or using total complexity and number of connected components. An expanded version of the ideas sketched here is [10]
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bochnack, J., Coste, M., Roy, M. F., “Géométrie Algébrique Réelle,” Springer-Verlag, 1988.
Borodin, A., Munro, I., “The Computational Complexity of Algebraic and Numeric Problems,” Elsevier, 1975.
Ben-Or, M., Lower Bounds for Algebraic Computation Trees, in “Proc.15-th ACM Annual Symp. on Theory of Comput.,” 1982., pp. 80–86.
Benedetti, R., Risler, J. J., “Real Algebraic and Semialgebraic Sets,” Hermann, 1990.
Coste, M., Roy, M. F., Thorn’s Lemma, the Coding of Real Algebraic Numbers and the Computation of Real Semialgebraic Sets, Journal of Symbolic Computation 5 (1988), 121–129,.
Cucker, F., Pardo, L. M., Raimondo, M. Recio, T., Roy, M.F., On the Computation of the Local and Global Analytic Structure of a Real Algebraic Curve, in “Proc. of A.A.E.C.C.-5,” Springer Lect. Notes in Comp. Science.356, 1989, pp. 161–182.
von zur Gathen, J., Algebraic Complexity Theory, Technical Report of the Department of Computer Science. University of Toronto, (1988).
Grigor’ev, D. Yu., Lower Bounds in Algebraic Complexity Computational Complexity, Journal of Soviet Math. 29 (1986), 1388–1425.
Manber, U., Tompa, M., Probabilistic, Nondeterministic and Alternating Decision Trees, Tech. Report No. 82-03-01, Univ. of Washington., (1982).
Montaña, J. L. Pardo, L. M. Recio, T., The Complexity of Semialgebraic Sets, Preprint 3/1990 — Dept. de Matemàticas — Univ. de Cantabria, (1990).
Pardo, L. M. Recio, T., Rabin’s Width of a Complete Proof and the Width of a Semialgebraic Set, in “Proc. EUROCAL’87,” Springer Lect. Notes in Comp. Science 378, 1989.
Preparata, F. P. Shamos, M. I., “Computational Geometry, An Introduction,” Texts and Monographs in Computer Science, Springer — Verlag, 1985.
Rabin, M. O., Proving Simultaneous Positivity of Linear forms, J. of Comp. and Sys. Sciences 6 (1972), 639–650.
Schürmann, F., Gradunabhängigen Stanken für die Topologie Semi-Algebraischer Mengen, Inaugural-dissertation zur Erlangun des Doktorgrades, Münster Universität, (1988).
Steele J. N. Yao, A. C., Lower Bounds for Algebraic Decision Trees, J. Algorithms 3 (1982), 1–8.
Strassen, V., Polynomials with rational coefficients which are hard to Compute, SIAM J. on Comp. 3 (1974), 128–149.
Yomdin, J., Metric Properties of semialgebraic sets and mappings and their applications in smooth analysis, in “Geometrie Algébrique et Applications III,” Travaux en cours 24, Hermann, 1987
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Montaña, J.L., Pardo, L.M., Recio, T. (1991). The non-scalar Model of Complexity in Computational Geometry. In: Mora, T., Traverso, C. (eds) Effective Methods in Algebraic Geometry. Progress in Mathematics, vol 94. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0441-1_23
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0441-1_23
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6761-4
Online ISBN: 978-1-4612-0441-1
eBook Packages: Springer Book Archive