메뉴 건너뛰기




Volumn 62, Issue 2, 2001, Pages 290-322

Graph Ramsey theory and the polynomial hierarchy

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

EID: 0035277680     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2000.1729     Document Type: Conference Paper
Times cited : (30)

References (32)
  • 6
  • 7
    • 0005363252 scopus 로고
    • Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
    • (1984) Discrete Math. , vol.50 , pp. 171-177
    • Burr, S.A.1
  • 8
    • 38249033299 scopus 로고
    • What can we hope to accomplish in generalized Ramsey theory?
    • (1987) Discrete Math. , vol.67 , pp. 215-225
    • Burr, S.A.1
  • 32
    • 0022733806 scopus 로고
    • The complexity of combinatorial problems with succinct input representation
    • (1986) Acta Inform. , vol.23 , pp. 325-356
    • Wagner, K.W.1


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