A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic

  title={A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic},
  author={Derek C. Oppen},
  journal={J. Comput. Syst. Sci.},

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 90 extracted citations

Decidability, complexity, and expressiveness of first-order logic over the subword ordering

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) • 2017
View 8 Excerpts
Highly Influenced

Compiler Construction

Lecture Notes in Computer Science • 2004
View 10 Excerpts
Highly Influenced

On Tool Support for Duration Calculus on the Basis of Presburger Arithmetic

2011 Eighteenth International Symposium on Temporal Representation and Reasoning • 2011
View 2 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…