Michael Ben-Or
- 1.Berman, L., "The complexity of logical theories," Theor. Comput. Sci. 11 (1980), 71-77.Google Scholar
Digital Library
- 2.Borodin, Hopcroft, von zur Gathen, "Fast parallel matrix and gcd computations," Proc. 23rd Symp. on Foundations of Computer Science, Nov. 1982, 65-71.Google Scholar
- 3.Brown, W. and J. F. Traub, "On Euclid's algorithm and the theory of subresultants," J. ACM 18 (1971), 505-514. Google ScholarDigital Library
- 4.Collins, G.E., "Quantifier elimination for real closed fields by cylindric algebraic decomposition," Proc. 2nd GI Conference on Automata Theory and Formal Languages, Springer-Verlag LNCS 35, Berlin, 1975, 134-183. Google ScholarDigital Library
- 5.Marden, M. Geometry of Polynomials. Amer. Math. Soc., Providence, 1966.Google Scholar
- 6.Mayr, E.W. and A.R. Meyer, "The complexity of the word problem for commutative semigroups and polynomial ideals," Adv. in Math 46 (1982), 305-329.Google ScholarCross Ref
- 7.Csanky, L., "Fast parallel matrix inversion algorithms," SIAM J. Comput. 5 (1976), 618-623.Google ScholarDigital Library
- 8.von zur Gathen, J., "Parallel algorithms for algebraic problems," Proc. 15th ACM Symp. on Theory of Computing, April 1983, 17-23. Google ScholarDigital Library
- 9.Monk, L. "An elementary-recursive decision procedure for Th(R,+,•)," manuscript, U. C. Berkeley, 1974.Google Scholar
- 10.Proc. ACM Symp. on Symbolic and Algebraic Computation, ed. Jenks, Yorktown Heights, NY, 1976.Google Scholar
- 11.Schwartz, J.T., and M. Sharir, "On the piano mover's problem II. General techniques for computing topological properties of real algebraic manifolds," Adv. in Appl. Math 4 (1983), 298-351.Google ScholarDigital Library
- 12.Tarski, A. "A decision method for elementary algebra and geometry," U. of Calif. Press, 1948; 2nd edition, 1951.Google Scholar
Index Terms
- The complexity of elementary algebra and geometry
Recommendations
On the Complexity of Kleene Algebra with Domain
Relational and Algebraic Methods in Computer ScienceAbstractWe prove that the equational theory of Kleene algebra with domain is EXPTIME-complete. Our proof makes essential use of Hollenberg’s equational axiomatization of program equations valid in relational test algebra. We also show that the equational ...
On the Complexity of Reasoning in Kleene Algebra
LICS '97: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer ScienceWe study the complexity of reasoning in Kleene algebra and *-continuous Kleene algebra in the presence of extra equational assumptions E; that is, the complexity of deciding the validity of universal Horn formulas E --> s=t, where E is a finite set of ...
Comments