Here are some of the main points about the proof:

1) NP-intermediate problems do not exist as the problems believed to
of this kind are NP-Complete.
for example the integer factorization problem is NP-Complete, so the
polynomial time hierarchy will collapse to its first level (i.e., NP
will equal co-NP).

Since P = NP if and only if P = PH.
(As the former we have established that NP = co-NP, which in turn
implies that NP = PH)

Existing proof techniques are not powerful enough to answer the
question, So here I am going to introduce a new concept of Relativity
in Computational Complexity.

So, while considering the above result now lets consider the case of
controlled relativity:

1) P = PH; which implies

2) P= NP

And in the case of uncontrolled relativity:

1) P!= HP; which implies

2) P!= NP

Explanation of the assumption made by Scott Aaronson, MIT regarding P= NP.

For details please have a look at my blog
http://solutionpversusnp.blogspot.com/ , where I have explained the
concept of relativity in detail with the help of Rubik Cube.

Thank you

Ravindra Chourase
Indian Institute of Technology Kharagpur

Kindly have a look inside…..here is the link:
http://solutionpversusnp.blogspot.com/

http://rjlipton.wordpress.com/2010/08/12/fatal-flaws-in-deolalikars-proof/

The problem I want solved is CB /= CWC. That is, Coffee Black is (Equal, Not Equal, Equivalent, or Approximately Equal) to Coffee With Cream.