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

4 weeks 10 hours ago

4 weeks 15 hours ago

4 weeks 2 days ago

4 weeks 2 days ago

4 weeks 4 days ago

4 weeks 4 days ago

4 weeks 6 days ago

4 weeks 6 days ago

4 weeks 6 days ago

4 weeks 6 days ago