Beyond Computation: The P versus NP question (panel discussion)

Richard Karp, moderator, UC Berkeley
Ron Fagin, IBM Almaden
Russell Impagliazzo, UC San Diego
Sandy Irani, UC Irvine
Christos Papadimitriou, UC Berkeley
Omer Reingold, Microsoft Research
Michael Sipser, Massachusetts Institute of Technology
Ryan Williams, Stanford University

[Osama]

As Michael Sipser has said at 36:34, the only way to prove that P=nP is to find a new way to factorise large numbers in polynomial time. Otherwise, forget it.

[Freshiefunnies]

What if someone figured out how to reuse time?

[Dhowlan]

Verifying a solution is completely unconnected to discovering a solution.

[brendawilliams]

Maybe your weak solution doesn’t prove a strong solution or vise versa. Maybe you just sleep at night like the Professor implied

[АлександрДунай-еъ]

Wilson Nancy Robinson Lisa Jones Laura