First Page | Document Content | |
---|---|---|
Date: 2017-08-08 03:28:34Computational 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 ARCADEAdd to Reading ListSource URL: www.cs.man.ac.ukDownload Document from Source WebsiteFile Size: 216,46 KBShare Document on Facebook |