<--- Back to Details
First PageDocument Content
MAX-3SAT / Combinatory logic / Mathematics / Theoretical computer science / Computer programming
Date: 2006-08-30 11:43:07
MAX-3SAT
Combinatory logic
Mathematics
Theoretical computer science
Computer programming

THE COMPLEXITY OF SATISFIABILITY PROBLEMS Thomas J. Schaefer* Department of Mathematics

Add to Reading List

Source URL: www.ccs.neu.edu

Download Document from Source Website

File Size: 1,05 MB

Share Document on Facebook

Similar Documents