The Complexity of Linear Problems in Fields

[1]  Volker Weispfenning,et al.  The Complexity of Elementary Problems in Archimedean Ordered Groups , 1985, European Conference on Computer Algebra.

[2]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[3]  Joos Heintz,et al.  Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields , 1983, Theor. Comput. Sci..

[4]  Martin Fürer,et al.  The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth , 1982, Theor. Comput. Sci..

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

[6]  S. Brown.  Bounds on Transfer Principles for Algebraically Closed and Complete Discretely Valued Fields , 1978 .

[7]  Donald W. Loveland,et al.  Presburger arithmetic with bounded quantifier alternation , 1978, STOC.

[8]  Leonard Berman,et al.  Precise bounds for presburger arithmetic and the reals with addition: Preliminary report , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Jeanne Ferrante,et al.  A Decision Procedure for the First Order Theory of Real Addition with Order , 1975, SIAM J. Comput..

[10]  M. Fischer,et al.  SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .

[11]  G. E. Collins,et al.  Quantifier Elimination for Real Closed Fields: A Guide to the Literature , 1983 .

[12]  A. Macintyre,et al.  Elimination of Quantifiers in Algebraic Structures , 1983 .

[13]  L. Dries.  Quantifier elimination for linear formulas over ordered and valued fields , 1981 .

[14]  Dexter Kozen,et al.  Complexity of Boolean Algebras , 1980, Theor. Comput. Sci..

[15]  J. Ferrante,et al.  The computational complexity of logical theories , 1979 .

[16]  Joachim von zur Gathen,et al.  Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben , 1976, Komplexität von Entscheidungsproblemen 1976.