Complexity of Semialgebraic Proofs with Restricted Degree of Falsity

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing - SAT 2006 ◽

10.1007/11814948_3 ◽

2006 ◽

pp. 11-21

Author(s):

Arist Kojevnikov ◽

Alexander S. Kulikov

Download Full-text