论文信息 - The complexity of elementary algebra and geometry

The complexity of elementary algebra and geometry

Abstract The theory of real closed fields can be decided in exponential space or parallel exponential time. In fixed dimension, the theory can be decided in NC .

[1] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[2] Leonard Berman,et al. The Complexity of Logical Theories , 1980, Theor. Comput. Sci..

[3] Joachim von zur Gathen. Parallel algorithms for algebraic problems , 1983, STOC '83.

[4] M. Marden. Geometry of Polynomials , 1970 .

[5] George E. Collins,et al. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[6] Joseph F. Traub,et al. On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.

[7] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .

[8] A. Meyer,et al. The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[9] L. Csanky,et al. Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[10] Allan Borodin,et al. Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[11] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .