SCOPUS 정보 검색 플랫폼

Journal of the ACM

Volumn 50, Issue 1, 2003, Pages 96-99

Three problems in computer science

(1) Valiant, Leslie G a

a HARVARD UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGNITIVE COMPUTATION; MATHEMATICAL FORMULATIONS; POLYNOMIAL RESOURCES; POWER OF COMPUTATION;

COGNITIVE SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; INTEGRAL EQUATIONS; NUMERICAL METHODS; POLYNOMIALS; PROBLEM SOLVING; SEMANTICS; STATISTICAL METHODS; TURING MACHINES;

COMPUTER SCIENCE;

EID: 4243184855 PISSN: 00045411 EISSN: None Source Type: Journal
DOI: 10.1145/602382.602410 Document Type: Review

Times cited : (56)

References (13)

1
- 5544255325
- Quantum complexity theory
- BERNSTEIN, E., AND VAZIRANI, U. V. 1997. Quantum complexity theory, SIAM J. Comput., 1411-1473.
- (1997) SIAM J. Comput. , pp. 1411-1473
- Bernstein, E.¹ Vazirani, U.V.²

2
- 0003830361
- University of Chicago Press, Chicago, Ill
- CARNAP, R. 1950. Logical Foundations of Probability. University of Chicago Press, Chicago, Ill.
- (1950) Logical Foundations of Probability
- Carnap, R.¹

3
- 85059770931
- The complexity of theorem proving procedures
- ACM, New York
- COOK, S. A. 1971. The complexity of theorem proving procedures. In Proceedings of the 3rd ACM symposium on Theory of computing. ACM, New York, 151-158.
- (1971) Proceedings of the 3rd ACM Symposium on Theory of Computing , pp. 151-158
- Cook, S.A.¹

4
- 0025535649
- An analysis of first-order logics of probability
- HALPERN, J. Y. 1990. An analysis of first-order logics of probability. Artif. Int., 46, 311-350.
- (1990) Artif. Int. , vol.46 , pp. 311-350
- Halpern, J.Y.¹

5
- 0003037529
- Reducibility among combinatorial problems
- R. E. Miller and J. W. Thatcher, Eds. Plenum Press, New York
- KARP, R. M. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. R. E. Miller and J. W. Thatcher, Eds. Plenum Press, New York, 85-103.
- (1972) Complexity of Computer Computations , pp. 85-103
- Karp, R.M.¹

6
- 0000202647
- Universal sorting problems
- LEVIN, L. A. 1973. Universal sorting problems. Prob. Inf. Trans., 9, 265-266.
- (1973) Prob. Inf. Trans. , vol.9 , pp. 265-266
- Levin, L.A.¹

7
- 0041969607
- Programs with commonsense
- HMSO, London, England
- MCCARTHY, J. 1959. Programs with commonsense. In Teddington conference on the Mechanization of Thought Processes. HMSO, London, England.
- (1959) Teddington Conference on the Mechanization of Thought Processes
- Mccarthy, J.¹

8
- 0003897694
- Addison-Wesley, Reading, Mass
- PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison-Wesley, Reading, Mass.
- (1994) Computational Complexity
- Papadimitriou, C.H.¹

9
- 0003391330
- Morgan-Kaufmann, Los Altos, Calif
- PEARL, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan-Kaufmann, Los Altos, Calif.
- (1988) Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
- Pearl, J.¹

10
- 84960561455
- On computable numbers, with an application to the Entscheidungsproblem
- TURING, A. M. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42, 230-265. Also 43, (1937), 544-546.
- (1936) Proc. Lond. Math. Soc. , vol.42 , pp. 230-265
- Turing, A.M.¹

11
- 84960561455
- TURING, A. M. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42, 230-265. Also 43, (1937), 544-546.
- (1937) Proc. Lond. Math. Soc. , vol.43 , pp. 544-546

12
- 0004170359
- Oxford University Press, New York
- VALIANT, L. G. 1994. Circuits of the Mind. Oxford University Press, New York.
- (1994) Circuits of the Mind
- Valiant, L.G.¹

13
- 0033875407
- Robust logics
- VALIANT, L. G. 2000. Robust logics. Artif. Int., 117, 231-253.
- (2000) Artif. Int. , vol.117 , pp. 231-253
- Valiant, L.G.¹

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