|
|
|
Volumn , Issue , 1991, Pages 2-12
|
|
Counting classes are at least as hard as the polynomial-time hierarchy
a
a
NONE
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
COUNTING CLASSES;
POLYNOMIAL TIME HIERARCHY;
COMPUTER METATHEORY;
|
|
EID: 0026372597
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (9)
|
|
References (27)
|
