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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 12, Issue 3, 1980, Pages 291-302

Complexity, convexity and combinations of theories

(1) Oppen, Derek C a

a STANFORD UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84969390910 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(80)90059-6 Document Type: Article

Times cited : (85)

References (22)

1
- 0003821935
- North-Holland, Amsterdam
- (1954) Solvable Cases of the Decision Problem
- Ackerman, W.¹

2
- 0002440902
- The complexity of logical theories
- (1980) Theoret. Comput. Sci. , vol.11 , pp. 71-77
- Berman, L.¹

3
- 0003930163
- North-Holland, Amsterdam
- (1970) Asymptotic Methods in Analysis , pp. 103-108
- de Bruijn, N.¹

4
- 84966254050
- Bounds on positive integral solutions of linear diophantine equations
- (1976) Proceedings of the American Mathematical Society , vol.55 , Issue.2 , pp. 299-304
- Borosh, I.¹ Treybig, L.B.²

5
- 0018020102
- Assignment commands with array references
- (1978) Journal of the ACM , vol.25 , Issue.4
- Downey, P.¹ Sethi, R.²

6
- 0002202224
- Super-exponential complexity of Presburger arithmetic
- (1973) Proc. Symposium on the Complexity of Real Computation Processes
- Fischer, M.¹ Rabin, M.²

7
- 84909532512
- Khachian's algorithm for linear programming
- Stanford University
- (1979) CS Report STAN-CS-79-750
- Gacs, P.¹ Lovasz²

8
- 0004018546
- Some completeness results in the mathematical theory of computation
- (1968) Journal of the ACM , vol.15
- Kaplan, D.M.¹

9
- 85025744476
- Computing Center, Academy Sciences USSR, Moscow, manuscript
- (1978) Polynomial algorithm for linear programming
- Khachian¹

10
- 85025735448
- C.G. Nelson and D.C. Oppen, Fast decision algorithms based on congruence closure, J. ACM, to appear.

11
- 84976700950
- Simplification by cooperating decision procedures
- (1979) ACM Trans. Programming Languages and Systems , vol.2 , Issue.1
- Nelson, C.G.¹ Oppen, D.C.²

12
- 0000555791
- n upper bound on the complexity of Presburger arithmetic
- (1978) Journal of Computer and System Sciences , vol.16 , Issue.3
- Oppen, D.C.¹

13
- 85025745817
- D.C. Oppen, Reasoning about recursively defined data structures, J. ACM, to appear.

14
- 0004008510
- manuscript
- (1977) Two easy theories whose combination is hard
- Pratt, V.¹

15
- 0002217486
- Uber die Vollstandigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt
- (1929) Comptes Rendus du 1er Congres des Mathematicians des Pays Slavs
- Presburger, M.¹

16
- 0018057588
- Presburger arithmetic with bounded quantifier alternation
- (1978) Proc. 10th Annual ACM Symposium on Theory of Computing
- Reddy, C.R.¹ Loveland, D.W.²

17
- 0018454851
- A practical decision procedure for arithmetic with function symbols
- (1979) J. ACM , vol.26 , Issue.2 , pp. 351-360
- Shostak, R.¹

18
- 84976769905
- Verification decidability of Presburger array programs
- University of Waterloo
- (1977) Proc. Conference on Theoretical Computer Science
- Suzuki, N.¹ Jefferson, D.²

19
- 85025717100
- An algorithm for checking PL/CV arithmetic inferences
- Department of Computer Science, Cornell University
- (1977) Technical Report 77-326
- Chan, T.¹

20
- 85025721315
- P. Downey, R. Sethi and R. Tarjan, Variations on the common subexpression problem, J. ACM, to appear.

21
- 84963701082
- Complexity of finitely represented algebras
- (1977) Proc. Annual ACM Symposium on Theory of Computing
- Kozen, D.¹

22
- 0017995402
- An algorithm for reasoning about equality
- (1978) Communications of the ACM , pp. 583-585
- Shostak, R.¹

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