![NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Logic in computer science / Hypergraph / Unsatisfiable core / Exponential time hypothesis / MAX-3SAT / Theoretical computer science / Mathematics / Applied mathematics NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Logic in computer science / Hypergraph / Unsatisfiable core / Exponential time hypothesis / MAX-3SAT / Theoretical computer science / Mathematics / Applied mathematics](https://www.pdfsearch.io/img/32c8d633053c6874daa2dbaffde5d556.jpg)
| Document Date: 2013-09-26 08:48:45 Open Document File Size: 310,92 KBShare Result on Facebook
City Berlin / Budapest / / Company CNF / / Country Germany / Switzerland / Hungary / Canada / / / Facility Institute of Theoretical Computer Science / Simon Fraser University / R´enyi Institute / / IndustryTerm computer search / binary search / search problem / / Organization United Nations / R´enyi Institute / Hungarian Academy of Sciences / Institute of Theoretical Computer Science / Simon Fraser University / / Person Benjamin Doerr / Joel Spencer / Breaker / / Position first player / chairman of the department / chairman / liar game Player / second player / player / dean / / PublishedMedium Theoretical Computer Science / / Technology SNP / /
SocialTag |