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

Derek C. Oppen (1978)

> Home

Details and statistics

DOI: 10.1016/0022-0000(78)90021-1

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/Oppen78
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Oppen78
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.