Some connections between nonuniform and uniform complexity classes

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 1980-April, Issue , 1980, Pages 302-309

  Karp, Richard M ^a   Lipton, Richard J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

NONUNIFORM COMPLEXITY; POLYNOMIAL-TIME; UNIFORM COMPLEXITY; UPPER BOUND;

TURING MACHINES;

EID: 84944053247     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800141.804678     Document Type: Conference Paper

References (0)