Login / Signup

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

Derek C. Oppen
Published in: J. Comput. Syst. Sci. (1978)
Keyphrases
  • upper bound
  • worst case
  • lower bound
  • presburger arithmetic
  • quantifier elimination
  • high level
  • expert systems
  • database systems
  • query processing
  • expressive power
  • lower and upper bounds