TR-2007008: The Satisfiability Problem—From the Theory of NP-Completeness to State-of-the-Art SAT Solvers

---

Autoria(s): Harpaz, Rave

Data(s)	01/01/2007
Formato	application/pdf
Identificador	http://academicworks.cuny.edu/gc_cs_tr/288 http://academicworks.cuny.edu/cgi/viewcontent.cgi?article=1287&context=gc_cs_tr
Idioma(s)	English
Publicador	CUNY Academic Works
Fonte	Computer Science Technical Reports
Palavras-Chave	#Computer Sciences
Tipo	report