Complexity of Semialgebraic Proofs with Restricted Degree of Falsity

DOI10.1007/11814948_3zbMATH Open1187.03047OpenAlexW1590132050MaRDI QIDQ5756572FDOQ5756572

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

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

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Cited In (7)

• Complexity of semialgebraic proofs with restricted degree of falsity
• Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
• Title not available (Why is that?)
• Hypersimplicity and semicomputability in the weak truth table degrees
• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)

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)