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

8 hours 40 min ago

23 hours 12 min ago

1 day 1 hour ago

3 days 12 min ago

3 days 1 hour ago

3 days 2 hours ago

3 days 9 hours ago

3 days 13 hours ago

3 days 17 hours ago

3 days 17 hours ago