Unsolvable systems of equations and proof complexity

zbMath0903.03033MaRDI QIDQ1126839

Toniann Pitassi

Publication date: 5 August 1998

Published in: Documenta Mathematica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/232165

zbMATH Keywords

surveypropositional proof complexitysystem of equationsalgebraic approach to the efficiency of propositional proof systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Complexity of proofs (03F20)

Related Items (1)

Characterizing Propositional Proofs as Noncommutative Formulas

This page was built for publication: Unsolvable systems of equations and proof complexity