Outer Web | Explore

/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 Stockmeyer's Approximate Counting Method \| Gödel's Lost Letter and P=NP
\|	\|	windowsontheory.org Structure vs. Combinatorics in Computational Complexity - Windows On Theory	4.2 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...	4.2 parsecs away Travel
\|	\|	live-simons-blog.pantheonsite.io Theory at the Institute and Beyond, October 2024 \| Calvin Café: The Simons Institute Blog	4.5 parsecs away Travel
\|	\|		4.5 parsecs away Travel
\|	\|	scottaaronson.blog Shtetl-Optimized » Blog Archive » Open Problems Related to Quantum Query Complexity	4.9 parsecs away Travel
\|	\|	Way back in 2005, I posed Ten Semi-Grand Challenges for Quantum Computing Theory, on at least half of which I'd say there's been dramatic progress in the 16 years since (most of the challenges were open-ended, so that it's unclear when to count them as "solved"). I posed more open quantum complexity problems in 2010,...	4.9 parsecs away Travel
\|	\|	zhengdongwang.com Superhuman AI in a Normal Age \| Zhengdong	28.8 parsecs away Travel
\|		Zhengdong Wang's personal website	28.8 parsecs away Travel