Complexity of Presburger arithmetic with fixed quantifier dimension

Theory of Computing Systems

Volumn 30, Issue 4, 1997, Pages 423-428

  Schoning U ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

DECISION PROBLEMS; POLYNOMIAL-TIME HIERARCHY; PRESBURGER ARITHMETIC;

DIGITAL ARITHMETIC;

EID: 0038877596     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679468     Document Type: Article

References (13)

1. L. Herman. The complexity of logical theories. Theoretical Computer Science 11 (1980), 71-77.
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
3. J. Ferrante, C.W. Rackoff. The Computational Complexity of Logical Theories. Lecture Notes in Mathematics, Vol. 718, Springer-Verlag, Berlin, 1979.
4. M.J. Fischer, M.O. Rabin. Super-exponential complexity of Presburger arithmetic. SIAM-AMS Proceedings 7(1974), 27-41.
5. M. Fürer. The complexity of Presburger arithmetic with bounded quantifier alternation depth. Theoretical Computer Science 18 (1982), 105-111.
6. M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
7. E. Grädel. The Complexity of Subclasses of Logical Theories. Dissertation, Universität Basel, 1987.
8. H. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research 8 (1983), 538-548.
9. C. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
10. C.R. Reddy, D.W. Loveland. Presburger arithmetic with bounded quantifier alternation. Proceedings of the 10th ACM Symposium on Theory of Computing, 1978, pp. 320-325.
11. B. Scarpellini. Complexity of subcases of Presburger arithmetic. Transactions of the AMS 284 (1984), 203-218.
12. L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science 3 (1977), 1-22.
13. C. Wrathall. Complete sets and the polynomial-time hierarchy. Theoretical Computer Science 3 (1977), 23-33.