The complexity of the equivalence problem for two characterizations of presburger sets
- 1 January 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 13 (3) , 295-314
- https://doi.org/10.1016/s0304-3975(81)80003-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Super-Exponential Complexity of Presburger ArithmeticPublished by Springer Nature ,1998
- Simple counter machines and number-theoretic problemsJournal of Computer and System Sciences, 1979
- An NP-complete number-theoretic problemPublished by Association for Computing Machinery (ACM) ,1978
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978
- Hierarchies of complete problemsActa Informatica, 1976
- Bounds on Positive Integral Solutions of Linear Diophantine EquationsProceedings of the American Mathematical Society, 1976
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A characterization of semilinear setsJournal of Computer and System Sciences, 1970
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966