/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 rjlipton.com
Is P=NP a Grave Matter? | Gödel's Lost Letter and P=NP
| | thetexasorator.com
An Interview with Dr. Scott Aaronson - The Texas Orator
5.5 parsecs away

Travel
| | An interview with UT computer scientist and OpenAI researcher Scott Aaronson.
| | blog.computationalcomplexity.org
Computational Complexity: Some thoughts on journals, refereeing, and the P vs NP problem
5.0 parsecs away

Travel
| | A guest post by Eric Allender prompted by an (incorrect)P? NP proof recently published in Springer Nature's Frontiers of Computer Scie...
| | windowsontheory.org
Structure vs. Combinatorics in Computational Complexity - Windows On Theory
5.3 parsecs away

Travel
| | (Also available as a pdf file. Apologies for the many footnotes, feel free to skip them.) Computational problems come in all different types and from all kinds of applications, arising from engineering as well the mathematical, natural, and social sciences, and involving abstractions such as graphs, strings, numbers, and more. The universe of potential algorithms...
| | dabacon.org
The Quantum Pontiff - O brave new quantum world!
27.6 parsecs away

Travel
| O brave new quantum world!