Determinism in the Certification of UNSAT Proofs Xaviera Steele Tomer Libal American University of Paris

First Page		Document Content
Date: 2017-09-19 19:50:55 Theoretical computer science Software engineering Mathematics Logic in computer science NP-complete problems Electronic design automation Formal methods Boolean algebra Prolog Logic programming Boolean satisfiability problem Sequent calculus		Determinism in the Certification of UNSAT Proofs Xaviera Steele Tomer Libal American University of Paris Add to Reading List Source URL: pxtp.github.io Download Document from Source Website File Size: 808,91 KB Share Document on Facebook

	Ng Kong Beng Public Lecture Series 黄光明公开讲座 For the past 40 years computer scientists generally believed that NP-complete problems are intractable. In particular, Boolean satisfiability (SAT), as a paradigma DocID: 1udfk - View Document
	Djinni 2.1 Approximating NP-Complete Problems, Fast Jeff Ohlmann, Barrett Thomas, Robert Hansen, Tristan Thiede Presented at OSCON 2006 DocID: 1tIrp - View Document
	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved DocID: 1rtvU - View Document
	On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon DocID: 1rsZm - View Document
	Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada DocID: 1rsEH - View Document