Date: 2008-11-12 04:43:46

Mathematical logic

Logic in computer science

Computational complexity theory

Proof complexity

Function

Mathematical proof

Resolution

Inequality

Mathematics

Theoretical computer science

Automated theorem proving

Journal on Satisfiability, Boolean Modeling and Computation[removed]Complexity of Semialgebraic Proofs with Restricted Degree of Falsity∗† Edward A. Hirsch Arist Kojevnikov

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 420,40 KB