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

메뉴 건너뛰기

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1584, Issue , 1999, Pages 179-187

On an optimal deterministic algorithm for SAT

(1) Sadowski, Zenon a

a UNIVERSITY OF BIALYSTOK (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC ALGORITHMS; PROOF SYSTEM;

COMPUTER CIRCUITS;

EID: 34548611197 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/10703163_13 Document Type: Conference Paper

Times cited : (10)

References (9)

1
- 0003997240
- 2nd edn. Springer- Verlag, Berlin Heidelberg New York 180
- Balcazar, J.L., Diaz, J., Gabarró, J.: Structural complexity I. 2nd edn. Springer- Verlag, Berlin Heidelberg New York (1995) 180
- (1995) Structural complexity I
- Balcazar, J.L.¹ Diaz, J.² Gabarró, J.³

2
- 85059770931
- The complexity of theorem proving procedures
- 182
- Cook, S.A.: The complexity of theorem proving procedures. In: Proc. 3rd ACM Symposium on Theory of Computing. (1971) 151-158 182
- (1971) Proc. 3rd ACM Symposium on Theory of Computing , pp. 151-158
- Cook, S.A.¹

3
- 0001601465
- The relative efficiency of propositional proof systems
- 179, 181, 181, 182
- Cook, S.A., Reckhow R.A.: The relative efficiency of propositional proof systems. J. Symbolic Logic 44 (1979) 36-50 179, 181, 181, 182
- (1979) J. Symbolic Logic , vol.44 , pp. 36-50
- Cook, S.A.¹ Reckhow, R.A.²

4
- 0010513146
- Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets
- 179, 180, 181, 182
- Kobler, J., Messner, J.: Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. In Proceedings of the 13th Annual IEEE Conference on Computational Complexity.(1998) 132-140 179, 180, 181, 182
- (1998) Proceedings of the 13th Annual IEEE Conference on Computational Complexity , pp. 132-140
- Kobler, J.¹ Messner, J.²

5
- 0001579141
- Propositional proof systems, the consistency of first order theories and the complexity of computations
- 179, 179, 180, 180, 181, 181, 184, 185
- Krajicek, J., Pudlak, P.: Propositional proof systems, the consistency of first order theories and the complexity of computations. J. Symbolic Logic 54 (1989) 1063-1079 179, 179, 180, 180, 181, 181, 184, 185
- (1989) J. Symbolic Logic , vol.54 , pp. 1063-1079
- Krajicek, J.¹ Pudlak, P.²

6
- 0000202647
- Universal sorting problems
- 179
- Levin, L.A.: Universal sorting problems. Problems of Information Transmission 9 (1973) 265 -266 179
- (1973) Problems of Information Transmission , vol.9 , pp. 265-266
- Levin, L.A.¹

7
- 84956979336
- Optimal proof systems for Propositional Logic and complete sets
- 179, 181
- Messner, J., Torán, J.: Optimal proof systems for Propositional Logic and complete sets. Electronic Colloquium on Computational Complexity. (1997) available via http://www.eccc.uni-trier.de/eccc/ 179, 181
- (1997) Electronic Colloquium on Computational Complexity
- Messner, J.¹ Torán, J.²

8
- 78951485210
- A survey of Russian Approaches to Perebor (Brute-Force Search) Algorithms
- 179
- Trakhtenbrot, B.A.: A survey of Russian Approaches to Perebor (Brute-Force Search) Algorithms. Annals of the History of Computing 6 (1984) 384-400 179
- (1984) Annals of the History of Computing , vol.6 , pp. 384-400
- Trakhtenbrot, B.A.¹

9
- 8344286076
- Optimal algorithms for co-NP sets and the EXP=NEXP problem
- 179, 186
- Verbitskii, O.V.: Optimal algorithms for co-NP sets and the EXP=NEXP problem. Matematicheskie Zametki M.V. Lomonosov Moscow State University 50 (1991) 37- 46 179, 186
- (1991) Matematicheskie Zametki M.V. Lomonosov Moscow State University , vol.50 , pp. 37-46
- Verbitskii, O.V.¹

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