Collapsing degrees in subexponential time

Proceedings of the IEEE Annual Structure in Complexity Theory Conference

Volumn , Issue , 1994, Pages 367-382

  Joseph, Deborah ^a   Pruim, Randall ^a   Young, Paul ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; MATHEMATICAL MODELS; POLYNOMIALS; RECURSIVE FUNCTIONS; THEOREM PROVING;

COLLAPSING DEGREES; ISOMORPHISM CONJECTURE; SUBEXPONENTIAL DETERMINISTIC TIME CLASSES;

FORMAL LANGUAGES;

EID: 0028602610     PISSN: 10636870     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)