Back to Search Start Over

Non-automatizability of bounded-depth Frege proofs.

Authors :
Bonet, M.L.
Domingo, C.
Gavalda, R.
Maciel, A.
Pitassi, T.
Source :
Proceedings Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (CatNo99CB36317); 1999, p15-23, 9p
Publication Year :
1999

Details

Language :
English
ISBNs :
9780769500751
Database :
Complementary Index
Journal :
Proceedings Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (CatNo99CB36317)
Publication Type :
Conference
Accession number :
92237985
Full Text :
https://doi.org/10.1109/CCC.1999.766258