Forbes, Michael A.; Shpilka, Amir; Tzameret, Iddo; Wigderson, Avi Proof complexity lower bounds from algebraic circuit complexity. (English) Zbl 07471587 Theory Comput. 17, Paper No. 10, 88 p. (2021). MSC: 68Q06 03F20 68Q15 68Q17 PDFBibTeX XMLCite \textit{M. A. Forbes} et al., Theory Comput. 17, Paper No. 10, 88 p. (2021; Zbl 07471587) Full Text: DOI
Li, Fu; Tzameret, Iddo; Wang, Zhengyu Characterizing propositional proofs as noncommutative formulas. (English) Zbl 1426.03037 SIAM J. Comput. 47, No. 4, 1424-1462 (2018). Reviewer: Saeed Salehi (Tabriz) MSC: 03F20 03B05 03D15 68Q15 68Q17 PDFBibTeX XMLCite \textit{F. Li} et al., SIAM J. Comput. 47, No. 4, 1424--1462 (2018; Zbl 1426.03037) Full Text: DOI arXiv
Müller, Sebastian; Tzameret, Iddo Short propositional refutations for dense random 3CNF formulas. (English) Zbl 1391.03042 Ann. Pure Appl. Logic 165, No. 12, 1864-1918 (2014). MSC: 03F20 03D15 03F30 03B05 68Q25 PDFBibTeX XMLCite \textit{S. Müller} and \textit{I. Tzameret}, Ann. Pure Appl. Logic 165, No. 12, 1864--1918 (2014; Zbl 1391.03042) Full Text: DOI
Tzameret, Iddo Algebraic proofs over noncommutative formulas. (English) Zbl 1251.03072 Inf. Comput. 209, No. 10, 1269-1292 (2011). MSC: 03F20 PDFBibTeX XMLCite \textit{I. Tzameret}, Inf. Comput. 209, No. 10, 1269--1292 (2011; Zbl 1251.03072) Full Text: DOI
Raz, Ran; Tzameret, Iddo Resolution over linear equations and multilinear proofs. (English) Zbl 1161.03034 Ann. Pure Appl. Logic 155, No. 3, 194-224 (2008). Reviewer: Emil Jeřábek (Praha) MSC: 03F20 PDFBibTeX XMLCite \textit{R. Raz} and \textit{I. Tzameret}, Ann. Pure Appl. Logic 155, No. 3, 194--224 (2008; Zbl 1161.03034) Full Text: DOI