The complexity of almost linear diophantine problems
- 30 November 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 10 (5) , 395-403
- https://doi.org/10.1016/s0747-7171(08)80051-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Complexity of subcases of Presburger arithmeticTransactions of the American Mathematical Society, 1984
- The complexity of presburger arithmetic with bounded quantifier alternation depthTheoretical Computer Science, 1982
- The complexity of logical theoriesTheoretical Computer Science, 1980
- An NP-Complete Number-Theoretic ProblemJournal of the ACM, 1979
- The Computational Complexity of Logical TheoriesLecture Notes in Mathematics, 1979
- A bound on solutions of linear integer equalities and inequalitiesProceedings of the American Mathematical Society, 1978
- The Diophantine problem for addition and divisibilityTransactions of the American Mathematical Society, 1978
- On the SUP-INF Method for Proving Presburger FormulasJournal of the ACM, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- A Decision Procedure for the First Order Theory of Real Addition with OrderSIAM Journal on Computing, 1975