Complexity of Semialgebraic Proofs with Restricted Degree of Falsity

DOI10.1007/11814948_3MaRDI QIDQ5756572zbMATH OpenOpenAlexFDO

Authors Arist Kojevnikov, Alexander S. Kulikov

Publication date 4 September 2007

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

Full work available at URL https://doi.org/10.1007/11814948_3

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• Complexity of semialgebraic proofs with restricted degree of falsity
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 1916823
• Proof complexity meets algebra
• scientific article; zbMATH DE number 2086404

Cited in

(7)

• scientific article; zbMATH DE number 2086627 (Why is no real title available?)
• Complexity of semialgebraic proofs with restricted degree of falsity
• scientific article; zbMATH DE number 1916823 (Why is no real title available?)
• scientific article; zbMATH DE number 2086404 (Why is no real title available?)
• Theory and Applications of Satisfiability Testing
• Hypersimplicity and semicomputability in the weak truth table degrees
• Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

This page was built for publication: Complexity of Semialgebraic Proofs with Restricted Degree of Falsity

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