Reducing the complexity of reductions

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 730-738

  Agrawal, Manindra ^a   Allender, Eric ^a   Impagliazzo, Russell ^a   Pitassi, Toniann ^a   Rudich, Steven ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; SET THEORY; THEOREM PROVING;

BERMAN-HARTMANIS ISOMORPHISM;

COMPUTATIONAL COMPLEXITY;

EID: 0030699604     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258533.258671     Document Type: Conference Paper

References (23)