A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Derek C. Oppen. A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic. J. Comput. Syst. Sci., 16(3):323-332, 1978.

@article{Oppen78,
  title = {A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic},
  author = {Derek C. Oppen},
  year = {1978},
  tags = {C++},
  researchr = {https://researchr.org/publication/Oppen78},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {16},
  number = {3},
  pages = {323-332},
}

runs on WebDSL