Non-automatizability of bounded-depth Frege proofs

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1999, Pages 15-23

  Bonet, Maria Luisa ^a   Domingo, Carlos ^a   Gavalda, Ricard ^a   Maciel, Alexis ^a   Pitassi, Toniann ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; FUNCTIONS; POLYNOMIALS; THEOREM PROVING; VECTORS;

BOUNDED DEPTH FREGE PROOFS; POLYNOMIAL TIME ALGORITHM;

COMPUTATIONAL COMPLEXITY;

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

References (16)