Outer Web | Explore

Explore >> Select a destination

You are here		terrytao.wordpress.com An abridged proof of Marton's conjecture \| What's new
\|	\|	francisbach.com Sums-of-squares for dummies: a view from the Fourier domain - Machine Learning Research Blog	3.9 parsecs away Travel
\|	\|		3.9 parsecs away Travel
\|	\|	rjlipton.com Proving Cook's Theorem \| Gödel's Lost Letter and P=NP	4.1 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...	4.1 parsecs away Travel
\|	\|	lucatrevisan.wordpress.com Earliest Connections of Additive Combinatorics and Computer Science \| in theory	3.8 parsecs away Travel
\|	\|	I am writing a short survey on connections between additive combinatorics and computer science for SIGACT News and I have been wondering about the "history" of the connections. (I will be writing as little as possible about history in the SIGACT article, because I don't have the time to research it carefully, but if readers...	3.8 parsecs away Travel
\|	\|	jrhawley.ca Calculating the cosine similarity across a set of samples	29.6 parsecs away Travel
\|		When collecting data from scientific experiments, it's often useful to compare individual samples against each other to see how similar they are. One way to do this is using the...	29.6 parsecs away Travel