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

21 hours 37 min ago

1 day 4 hours ago

1 day 15 hours ago

1 day 16 hours ago

2 days 15 hours ago

2 days 18 hours ago

2 days 19 hours ago

2 days 19 hours ago

2 days 21 hours ago

3 days 50 min ago