Algebraic Proofs over Noncommutative Formulas

DOI10.1007/978-3-642-13562-0_7zbMath1284.03262arXiv1004.2159OpenAlexW2163168463MaRDI QIDQ3569064

Iddo Tzameret

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.2159

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

This page was built for publication: Algebraic Proofs over Noncommutative Formulas