SCOPUS 정보 검색 플랫폼

Volumn 31, Issue 2, 1985, Pages 288-301

Games against nature

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY AND ANALYSIS; OPTIMIZATION;

DECISION-MAKING UNDER UNCERTAINTY; PSPACE;

COMPUTER METATHEORY;

EID: 0020828377 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/0022-0000(85)90045-5 Document Type: Article

Times cited : (170)

References (17)

3
- 84915702163
- M. Chandy and J. Robinson, unpublished manuscript, University of Texas, Austin, 1982.

4
- 85059770931
- The complexity of theorem proving procedures
- (1971) Proc. 3rd ACM Symposium on the Theory of Computing , pp. 151-158
- Cook¹

5
- 0003430814
- Prentice-Hall, Englewood Cliffs, N.J
- (1982) Dynamic Programming: Models and Applications
- Denardo¹

6
- 0003421685
- Academic Press, New York
- (1972) Finite State Markov Decision Processes
- Derman¹

8
- 0001309322
- The planar Hamilton circuit problem is NP-complete
- (1976) SIAM Journal on Computing , vol.5 , pp. 704-714
- Garey¹ Johnson² Tarjan³

9
- 0000595574
- The computational complexity of probabilistic Turing machines
- (1977) SIAM Journal on Computing , vol.6 , pp. 675-695
- Gill¹

10
- 0003644124
- MIT Press, Cambridge, Mass
- (1960) Dynamic Programming and Markov Processes
- Howard¹

11
- 84915702162
- The complexity of periodic of periodic problems
- (1980) Proc. 21st ACM Sympos. Theory of Comput.
- Orlin¹

13
- 84944029574
- Logics for probabilistic programming
- (1980) Proc. 12th ACM Sympos. Theory of Comput.
- Reie¹

14
- 0000922218
- The complexity of some two-person perfect-information games
- (1978) J. Comput. System Sci. , vol.16 , pp. 185-225
- Schaefer¹

15
- 44649167785
- The polynomial time hierarchy
- (1976) Theoretical Computer Science , vol.1 , pp. 1-22
- Stockmeyer¹

16
- 49249151236
- The complexity of computing the permanent
- (1979) Theor. Comput. Sci.
- Valiant¹

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