Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
A 222pn upper bound on the complexity of Presburger Arithmetic
Home
Publications
A 222pn upper bound on the complexity of Presburger Arithmetic
A 222pn upper bound on the complexity of Presburger Arithmetic
DO
Derek C. Oppen
Derek C. Oppen
Publisher Website
Google Scholar
Add to Library
Cite
Download
Share
Download
1 June 1978
journal article
Published by
Elsevier
in
Journal of Computer and System Sciences
Vol. 16
(3)
,
323-332
https://doi.org/10.1016/0022-0000(78)90021-1
Abstract
No abstract available
Keywords
UPPER BOUND
PRESBURGER ARITHMETIC
Cited by 105 articles