### Some Useful Links

TensorFlow: https://www.tensorflow.org/ Open AI https://www.openai.com/blog/ Advertisements

Skip to content
# Systems, Networks and Control

## A website about control in complex networks

### Some Useful Links

### The spectral proof of the Szemeredi regularity lemma

### A Quasipolynomial Time Algorithm for Graph Isomorphism: The Details

### Quote

### Quote

May 31, 2016

TensorFlow: https://www.tensorflow.org/ Open AI https://www.openai.com/blog/ Advertisements

November 13, 2015

There are many proofs of this lemma, which is actually not that difficult to establish; see for instance these previous blog posts for some examples. In this post I would like to record one further proof, based on the spectral decomposition of the adjacency matrix of , which is essentially due to Frieze and Kannan. … More The spectral proof of the Szemeredi regularity lemma

November 13, 2015

Source: A Quasipolynomial Time Algorithm for Graph Isomorphism: The Details

April 1, 2015

Originally posted on Systems, Networks and Control:

“Fundamental progress has to do with the reinterpretation of basic ideas.” — Alfred North Whitehead

January 27, 2015

“Fundamental progress has to do with the reinterpretation of basic ideas.” — Alfred North Whitehead

What's new

Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Tao