Hey, everyone -
The recent buzz over the 3SAT paper has brought an unanswered ? from college back to the front of my mind, and I was hoping someone else could help me out.
I understand SAT as a problem and its implications for P/NP. What I'm not clear on, and which my computational complexity professor couldn't/wouldn't elaborate on, is why 3SAT is the "interesting" form of this problem to use?
Conceptually, using clauses makes sense because it allows us to express the logical relationship between literals, but why is it useful to restrict clauses to 3 booleans? Why not 2? Why not 5? What's magic about 3?
ADDED IN EDIT: http://en.wikipedia.org/wiki/2-satisfiability