SAT Has No Wizards

Details SAT Has No Wizards SAT Has No Wizards

2008-02-13

arxiv.org/abs/0802.1790v1

Computer Science

Computational Complexity

19 pages

Scientific paper

An (encoded) decision problem is a pair (E, F) where E=words that encode instances of the problem, F=words to be accepted. We use "strings" in a technical sense. With an NP problem (E, F) we associate the "logogram" of F relative to E, which conveys structural information on E, F, and how F is embedded in E. The kernel Ker(P) of a program P that solves (E, F) consists of those strings in the logogram that are used by P. There are relations between Ker(P) and the complexity of P. We develop an application to SAT that relies upon a property of internal independence of SAT. We show that SAT cannot have in its logogram strings serving as collective certificates. As consequence, all programs that solve SAT have same kernel.

Affiliated with

Also associated with

No associations

Rating

SAT Has No Wizards does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with SAT Has No Wizards, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and SAT Has No Wizards will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676585