Outer Web | Explore

Explore >> Select a destination

You are here		a3nm.net Summary on (hyper)graph tractability parameters - a3nm's blog
\|	\|	11011110.github.io Linkage for the start of another academic year	9.9 parsecs away Travel
\|	\|	Shift networks (\(\mathbb{M}\)). Jeremy Kun asks how to permute vectors using few vector additions, elementwise multiplications, and rotation operations, for...	9.9 parsecs away Travel
\|	\|	rjlipton.com Proving Cook's Theorem \| Gödel's Lost Letter and P=NP	5.0 parsecs away Travel
\|	\|	Another proof idea using finite automata Steve Cook proved three landmark theorems with 1971 dates. The first has been called a "surprising theorem": that any deterministic pushdown automaton with two-way input tape can be simulated in linear time by a random-access machine. This implies that string matching can be done in linear time, which inspired...	5.0 parsecs away Travel
\|	\|	gowers.wordpress.com When is proof by contradiction necessary? \| Gowers's Weblog	4.4 parsecs away Travel
\|	\|	It's been a while since I have written a post in the "somewhat philosophical" category, which is where I put questions like "How can one statement be stronger than an another, equivalent, statement?" This post is about a question that I've intended for a long time to sort out in my mind but have found...	4.4 parsecs away Travel
\|	\|	booksandpictures.wordpress.com A hot black cat and a ferociously-groomed white dog \| Books and Pictures	39.4 parsecs away Travel
\|		Cat is mine, dog is not.	39.4 parsecs away Travel