Non-commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs : In Proceedings of the 30th Annual Computational Complexity Conference (CCC): June 17-19, 2015. Invited to the special journal issue on CCC'15 (Comput. Complexity CC). . / Li, Fu; Tzameret, Iddo; Wang, Zhengyu.

2015. 412-432 Paper presented at COMPUTATIONAL COMPLEXITY Conference, Oregon, United States.

Research output: Contribution to conferencePaperpeer-review

Published

Documents

Original languageEnglish
Pages412-432
Number of pages21
DOIs
Publication statusPublished - 17 Jun 2015
EventCOMPUTATIONAL COMPLEXITY Conference - Oregon, United States
Duration: 7 Jun 201514 Jun 2017
Conference number: 31

Conference

ConferenceCOMPUTATIONAL COMPLEXITY Conference
Abbreviated titleCCC
CountryUnited States
CityOregon
Period7/06/1514/06/17
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 26183953