Non-automatizability of bounded-depth Frege proofs.

MLA

Bonet, M. L., et al. “Non-Automatizability of Bounded-Depth Frege Proofs.” Proceedings Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (CatNo99CB36317), Jan. 1999, pp. 15–23. EBSCOhost, https://doi.org/10.1109/CCC.1999.766258.

APA

Bonet, M. L., Domingo, C., Gavalda, R., Maciel, A., & Pitassi, T. (1999). Non-automatizability of bounded-depth Frege proofs. Proceedings Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (CatNo99CB36317), 15–23. https://doi.org/10.1109/CCC.1999.766258

Chicago

Bonet, M.L., C. Domingo, R. Gavalda, A. Maciel, and T. Pitassi. 1999. “Non-Automatizability of Bounded-Depth Frege Proofs.” Proceedings Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (CatNo99CB36317), January, 15–23. doi:10.1109/CCC.1999.766258.