Isomorphism theorem for circuit complexity

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1996, Pages 2-11

  Agrawal, Manindra ^a   Allender, Eric ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCUIT THEORY; COMPUTATIONAL METHODS; ENCODING (SYMBOLS); EQUIVALENCE CLASSES; FUNCTIONS; POLYNOMIALS; SET THEORY;

BERMAN HARTMANIS CONJECTURE; CIRCUIT COMPLEXITY; COMPLEXITY CLASSES; DLOGTIME UNIFORM; ISOMORPHISM THEOREM;

COMPUTATIONAL COMPLEXITY;

EID: 0029697052     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)