Doron Zeilberger announced yesterday that he has proven that P=NP.

Using 3000 hours of CPU time on a CRAY machine, we settle the notorious P vs. NP problem in the affirmative, by presenting a â€œpolynomialâ€ time algorithm for the NP-complete subset sum problem.

The paper is available here and his 98^{th} Opinion is offered as commentary.

## Recent comments

2 days 7 hours ago

3 days 7 hours ago

3 days 9 hours ago

3 days 9 hours ago

4 days 15 hours ago

4 days 16 hours ago

5 days 10 hours ago

5 days 12 hours ago

5 days 12 hours ago

6 days 4 hours ago