메뉴 건너뛰기




Volumn 1770, Issue , 2000, Pages 157-168

The boolean hierarchy of NP-partitions

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EID: 84944041526     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_13     Document Type: Conference Paper
Times cited : (33)

References (8)
  • 6
    • 0024134606 scopus 로고
    • The polynomial time hierarchy collapses if the Boolean hierarchy collapses
    • Erratum in same journal 20(2):404, 1991
    • J. Kadin. The polynomial time hierarchy collapses if the Boolean hierarchy collapses. SIAM Journal on Computing, 17(6):1263-1282, 1988. Erratum in same journal 20(2):404, 1991.
    • (1988) SIAM Journal on Computing , vol.17 , Issue.6 , pp. 1263-1282
    • Kadin, J.1


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