메뉴 건너뛰기




Volumn 32, Issue 2, 2000, Pages 129-136

The length of infinite time turing machine computations

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0002267685     PISSN: 00246093     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0024609399006657     Document Type: Article
Times cited : (44)

References (2)
  • 1
    • 0039626505 scopus 로고    scopus 로고
    • Chromatic-index-critical graphs of even order
    • S. GRÜNEWALD and E. STEFFEN, 'Chromatic-index-critical graphs of even order', J. Graph Theory 30 (1999) 27-36.
    • (1999) J. Graph Theory , vol.30 , pp. 27-36
    • Grünewald, S.1    Steffen, E.2
  • 2
    • 0000086102 scopus 로고
    • Some unsolved problems in graph theory
    • V. G. VIZING, 'Some unsolved problems in graph theory', Russian Math. Surveys 6 (1968) 125-142.
    • (1968) Russian Math. Surveys , vol.6 , pp. 125-142
    • Vizing, V.G.1


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