메뉴 건너뛰기




Volumn 2533, Issue , 2002, Pages 164-172

On the absence of predictive complexity for some games

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84942747325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36169-3_15     Document Type: Conference Paper
Times cited : (4)

References (7)
  • 2
    • 0037185201 scopus 로고    scopus 로고
    • General linear relations among different types of predictive complexity
    • Y. Kalnishkan. General linear relations among different types of predictive complexity. Theoretical Computer Science, 271:181–200, 2002.
    • (2002) Theoretical Computer Science , vol.271 , pp. 181-200
    • Kalnishkan, Y.1
  • 6


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