Back to Results
First PageMeta Content
Automated theorem proving / Logic in computer science / NP-complete problems / Boolean algebra / Logic programming / Boolean satisfiability problem / Unit propagation / Resolution / Clause / Theoretical computer science / Mathematics / Mathematical logic


Preprocessing and Inprocessing Techniques in SAT Armin Biere Institute for Formal Models and Verification Johannes Kepler University Linz, Austria
Add to Reading List

Document Date: 2011-09-06 10:46:19

Open Document

File Size: 322,84 KB

Share Result on Facebook

Country

Austria / /

Facility

SAT Armin Biere Institute / /

IndustryTerm

search time / /

Organization

Institute for Formal Models and Verification Johannes Kepler University Linz / /

Technology

Putnam algorithm / /

SocialTag