Subclasses of presburger arithmetic and the polynomial-time hierarchy
Open Access
- 31 March 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 56 (3) , 289-301
- https://doi.org/10.1016/0304-3975(88)90136-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Complexity of subcases of Presburger arithmeticTransactions of the American Mathematical Society, 1984
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- The complexity of presburger arithmetic with bounded quantifier alternation depthTheoretical Computer Science, 1982
- AlternationJournal of the ACM, 1981
- The complexity of logical theoriesTheoretical Computer Science, 1980
- A bound on solutions of linear integer equalities and inequalitiesProceedings of the American Mathematical Society, 1978
- The polynomial-time hierarchyTheoretical Computer Science, 1976