Beyond DRAT: Challenges in Certifying UNSAT1 Bertram Felgenhauer University of Innsbruck ARCADE

First Page		Document Content
Date: 2017-08-08 03:28:34 Computational complexity theory Conflict-driven clause learning Drat Exponential time hypothesis Felgenhauer NP-complete problems		Beyond DRAT: Challenges in Certifying UNSAT1 Bertram Felgenhauer University of Innsbruck ARCADE Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 216,46 KB Share Document on Facebook