The long list of false proofs that P is not equal to NP

The open problem P = NP asks whether every problem whose solution can be verified quickly can also be solved quickly. Numerous approaches have attempted to prove that P is different from NP, but all have proven to be erroneous. The complexity theory specialist Gerhard Woeginger keeps the list of these errors up to date.