Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
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
Author:
DO
Derek C. Oppen
Derek C. Oppen
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 June 1978
journal article
Published by
Elsevier
in
Journal of Computer and System Sciences
Vol. 16
(3)
,
323-332
DOI:
10.1016/0022-0000(78)90021-1
Abstract
No abstract available
Keywords
UPPER BOUND
PRESBURGER ARITHMETIC
Cited
Cited by 166 articles
Scroll to top