Back to Results
First PageMeta Content
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
Add to Reading List

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

Open Document

File Size: 420,40 KB

Share Result on Facebook

City

St.Petersburg / St. Petersburg / /

Company

CNF / cCP / /

/

Event

Reorganization / /

Facility

Delft University of Technology / Steklov Institute of Mathematics / /

IndustryTerm

degree proof systems / dag-like derivation systems / tree-like systems / proof systems / i.e. products / semialgebraic proof systems / /

Organization

Institute of Mathematics / Russian Science Support Foundation / Delft University of Technology / Russian Foundation for Basic Research / /

Person

Sergey I. Nikolenko / Edward A. Hirsch Arist Kojevnikov Alexander / /

Position

first author / /

Product

Pentax K-x Digital Camera / Weakening / /

Technology

simulation / /

SocialTag