SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 16, Issue 3, 1978, Pages 323-332

A 222pn upper bound on the complexity of Presburger Arithmetic

(1) Oppen, Derek C a

a STANFORD UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000555791 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/0022-0000(78)90021-1 Document Type: Article

Times cited : (133)

References (7)

1
- 84966254050
- Bounds on positive integral solutions of linear diophantine equations
- (1976) Proceedings of the American Mathematical Society , pp. 299-304
- Borosh¹ Treybig²

2
- 0003083237
- Theorem proving in arithmetic without multiplication
- (1972) Machine Intelligence , vol.7 , pp. 91-99
- Cooper¹

3
- 84916057136
- A Decision Procedure for the First Order Theory of Real Addition with Order
- Massachusetts Institute of Technology
- (1973) MAC Technical Memorandum , vol.33
- Ferrante¹ Rackoff²

4
- 0002202224
- Super-exponential complexity of Presburger arithmetic
- (1973) Proceedings of the Symposium on the Complexity of Real Computation Processes
- Fischer¹ Rabin²

5
- 0000553440
- manuscript
- (1972) Weak Monadic Second Order Theory of Successor is not Elementary Recursive
- Meyer¹

6
- 0002217486
- Über die Vollstandigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchen die Addition als einzige Operation hervortritt
- (1929) Comptes-Rendus du ler Congres des Mathématiciens des Pays Slavs
- Presburgbr¹

7
- 84916057133
- M. Rabin, private communication. 1972.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.