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).

Fu Li; Iddo Tzameret; Zhengyu Wang

doi:10.4230/LIPIcs.CCC.2015.412

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).

Fu Li, Iddo Tzameret, Zhengyu Wang

Research output: Contribution to conference › Paper › peer-review

94 Downloads (Pure)

Original language	English
Pages	412-432
Number of pages	21
DOIs	https://doi.org/10.4230/LIPIcs.CCC.2015.412
Publication status	Published - 17 Jun 2015
Event	COMPUTATIONAL COMPLEXITY Conference - Oregon, United States Duration: 7 Jun 2015 → 14 Jun 2017 Conference number: 31

Conference

Conference	COMPUTATIONAL COMPLEXITY Conference
Abbreviated title	CCC
Country/Territory	United States
City	Oregon
Period	7/06/15 → 14/06/17

Keywords

complexity theory

Access to Document

10.4230/LIPIcs.CCC.2015.412Licence: CC BY

Accepted ManuscriptAccepted author manuscript, 840 KBLicence: CC BY

Cite this

Li, F., Tzameret, I., & Wang, Z. (2015). 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). . 412-432. Paper presented at COMPUTATIONAL COMPLEXITY Conference, Oregon, United States. https://doi.org/10.4230/LIPIcs.CCC.2015.412

Li, Fu ; Tzameret, Iddo ; Wang, Zhengyu. / 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). . Paper presented at COMPUTATIONAL COMPLEXITY Conference, Oregon, United States.21 p.

@conference{e39ea42c445a4dfd8939068d5409f2cf,

title = "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). ",

keywords = "complexity theory",

author = "Fu Li and Iddo Tzameret and Zhengyu Wang",

note = " Invited to the special journal issue on CCC'15.; COMPUTATIONAL COMPLEXITY Conference, CCC ; Conference date: 07-06-2015 Through 14-06-2017",

year = "2015",

month = jun,

day = "17",

doi = "10.4230/LIPIcs.CCC.2015.412",

language = "English",

pages = "412--432",

}

Li, F, Tzameret, I & Wang, Z 2015, '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). ', Paper presented at COMPUTATIONAL COMPLEXITY Conference, Oregon, United States, 7/06/15 - 14/06/17 pp. 412-432. https://doi.org/10.4230/LIPIcs.CCC.2015.412

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 conference › Paper › peer-review

TY - CONF

T1 - Non-commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs

T2 - COMPUTATIONAL COMPLEXITY Conference

AU - Li, Fu

AU - Tzameret, Iddo

AU - Wang, Zhengyu

N1 - Conference code: 31

PY - 2015/6/17

Y1 - 2015/6/17

KW - complexity theory

U2 - 10.4230/LIPIcs.CCC.2015.412

DO - 10.4230/LIPIcs.CCC.2015.412

M3 - Paper

SP - 412

EP - 432

Y2 - 7 June 2015 through 14 June 2017

ER -

Li F, Tzameret I, Wang Z. 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). . 2015. Paper presented at COMPUTATIONAL COMPLEXITY Conference, Oregon, United States. doi: 10.4230/LIPIcs.CCC.2015.412