I've skimmed the first couple of pages, and in essence he seems to be setting up to show that a circuit that's sufficiently complex to solve the clique problem will have to have an exponential number of components. That would imply that any algorithm to solve "Clique" would be exponential, hence super-polynomial, hence not in "P".
Problem is, others have proven that there are technical barriers to this approach, and I see no hint of the author explicitly saying why his approach avoids these problems.
For more about this concern, see points 1, 4, and 6 in this very accessible post:
http://www.scottaaronson.com/blog/?p=458
The PowerPoint talk "Has There Been Progress on the P vs. NP Question?" lunk to at the end of that post (before the comments) is a very good, accessible overview and is an excellent starting point to highlight what you need to follow up on.
Wikipedia's section on why the proof of P=NP or P!=NP is likely to be hard is also useful reading:
http://en.wikipedia.org/wiki/P_versus_NP_problem#Results_abo...
The whole idea of "verify" versus "find" makes no sense for problems with a yes/no answer, because if you can verify a boolean answer in polynomial time, you can always find the solution in polynomial time too, after all there are only two possible solutions so you need to verify only one to find the answer.
If you need extra data to prove this "yes" in polynomial time, then the answer isn't a boolean anymore, but a boolean plus the extra data, so how can you still call that a yes/no problem?
It doesn't work that way. The common characteristic of NP-complete problems is that there are an exponential number of possible solutions, but verifying that a purported solution is a solution takes only polynomial time.
For example consider SAT (see http://en.wikipedia.org/wiki/Boolean_satisfiability_problem for more). This is the problem of deciding whether there is a set of possible variable values that make a given Boolean equation evaluate to True. For an equation of length n there are in general O(n) variables, and therefore 2^O(n) possible sets of true/false values that the variables can have. So a brute force search takes exponential time.
But if you give me an equation, AND a set of values for the variables that you claim will result in the final expression evaluating to True, I can verify it in time O(n).
Does that answer your question?
You are combining two distinct concepts: the answer and the 'evidence'. The answer to an NP-complete problem is always Yes or No. But, we say that we can "verify" a decision problem in polynomial time if, given an answer AND evidence, we can check that the answer is true.
For concreteness: the k-clique problem (determining if there's a clique of at least size k in a graph) is hard. But, if somebody told us the answer was Yes, and gave us appropriate evidence (say, a set of k nodes in the graph which form a clique), verifying would be easy.
There exists a proof that NAND gates are all you ever need to compute an arbitrary boolean function from M bits to N bits. Actually, you also need a "copy" gate -- the ability to generate two bits with value X from one bit with value X -- and "wires" to communicate values from gate to gate, but that's about it.
The proof starts out like this: "a function from M bits to N bits is actually just N functions from M bits to 1 bit, as long as I can copy the input N times and feed it to the N functions which compute each output bit. So if I solve the problem for M-to-1, I automatically solve M-to-N as long as I have COPY and SWAP gates."
It's very important to see that the exact same approach is being used in the P-vs-NP question. P and NP are designed to be about functions which take M bits to 1 bit, hence they are "decision problems" with a boolean output but a variable input.
The question "P = NP?" can also be phrased more common-sensically, if not totally precisely, as "is brute force ever really necessary?". What is brute force? It is if you have to try a substantial fraction of the 2^M inputs to find a certain 1-bit output. What does this look like here? Well, that gets more complicated because we use scaling of a problem and a system of solution to discuss what's going on.
So a problem is in NP if (1) you can reduce it to some sort of M-bit input to 1-bit output, and (2) there exists some constant number K such that if I double the input size from M to 2M, the circuit has no more than K times the number of gates. This gives the logic circuit a "polynomial-time" size.
Then a problem is in P if we can find an input which makes the output 1 in a polynomial number of gates as well. Thus this is the "inverse" problem, "find me an input which makes this function 1." In fact we've just defined what's called a "satisfiability problem" -- find an input which satisfies this polynomial-size M-variable boolean formula.
A problem is in NP-complete if the recursion holds: if you can implement COPY and NAND and wires in that system in a polynomial number of gates, so that any problem in NP can be written in terms of your problem. This is part of the value of having these "constant K" constraints rather than specifying a given K; we get to define these NP-complete cases as the "hardest cases in NP," because if you can reverse them, then you can reverse any other problem in NP.
Does that help?
Context: Some problems are easy, and known to be easy. Some problems appear to be hard, and yet easy to verify alleged solutions. That seems odd - let's have a closer look.
Example:
Consider being given a network and asked if there's a path that visits every node exactly once and returns to its starting point. (This is the task of asking if a Hamilton Cycle exists). If the network is big enough, deciding if this can be done can be really hard. However, checking if someone has successfully done it is easy.
Motivation for a definition of NP:
A problem for which it is efficient (for which read "polynomial") to check a purported solution is said to be in "NP". Knowing whether a Hamilton cycle exists in a network is one of many, many such problems.
Definition: A problem is in "NP" if there is a polynomial time algorithm to test an alleged solution.
Definition: A problem is in "P" if there is a polynomial time algorithm to solve it.
Lemma: All problems in "P" are also in "NP". Proof left to the interested reader.
(Note: technically we are dealing with Decision Problems - problems where the answer is always Yes or No. For example, I didn't ask you to find a Hamilton Cycle, I only asked if there was one. Sometimes the Decision version can be ramped up into actually finding the solution.)
Note that easy problems (for example, finding a cycle that visits every edge exactly once - an Euler Cycle) is also "NP", but it's not a hard NP problem - it's actually in "P". This point confuses a lot of people. NP does not automatically mean hard - that comes in a minute.
Another example:
Similarly, factoring a large integer can be really hard, but if someone claims to have a factor, checking it is as easy as doing the division.
Comparing problems:
Cleverly, it can be shown that if you can solve the Hamilton Circuit problem efficiently, that can be converted into a way of solving the factoring problem. In some very real sense, the Hamilton Circuit problem is harder than (or equal to) the factoring problem.
Finding:
There are many, many NP problems that have been shown all to be equivalent to each other, all to be easy to check solutions, and yet no algorithm for solving in polynomial time known. Such problems are call NP-Complete (NPC) because an efficient algorithm for any of them will completely solve all the NP problems.
So:
* A problem is said to be in "P" if there is an algorithm that takes instances and produces answers in polynomial time.
* A problem is said to be in "NP" if there is an algorithm that takes only polynomial time to check a purported solution for correctness.
* It is unknown if there are any problems that are in "NP", but not in "P".
That is the P vs NP question, and the Clay Mathematics Institute has offered $10^6 for its resolution. You could do this by showing that there is a polynomial time algorithm for any of the NPC problems, or by showing that no such algorithm exists.
Summary:
* P problems are "easy"
* NPC problems are thought to be hard
* There are lots of NPC problems, and solving any one of them would solve all NP problems.
* Integer factoring (IF) is thought to be outside P, but not as hard as NPC.
* There are problems that are harder than all NPC problems, these are called NP-Hard.
So we think that
But we don't know if these are, in fact, all different. The submitted link is to a paper that says yes, they are all different.I hope that helps.