scientific article; zbMATH DE number 1059248

zbMATH Open0880.68118MaRDI QIDQ4353563FDOQ4353563

Authors: Toniann Pitassi 

Publication date: 10 September 1997

Title of this publication is not available (Why is that?)

Recommendations

• Algebraic proof systems over formulas.
• Unsolvable systems of equations and proof complexity
• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 1860672

zbMATH Keywords

algebraic proof systemspropositional calculus

Mathematics Subject Classification ID

Cited In (16)

• Characterizing propositional proofs as noncommutative formulas
• Proof Complexity Meets Algebra
• Linear gaps between degrees for the polynomial calculus modulo distinct primes
• Unsolvable systems of equations and proof complexity
• Varieties of algebraic systems and propositional calculi
• Proposition algebra
• On the automatizability of polynomial calculus
• Several notes on the power of Gomory-Chvátal cuts
• Propositional representation of arithmetic proofs (preliminary version)
• Automating algebraic proof systems is NP-hard
• Title not available (Why is that?)
• On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
• Algebraic proofs over noncommutative formulas
• Logical Closure Properties of Propositional Proof Systems
• Algebraic proof systems over formulas.
• Proof Systems for Effectively Propositional Logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353563)