Explore >> Select a destination
|
You are here 
|
terrytao.wordpress.com | ||
| | | | |
thatsmaths.com
|
|
| | | | | ||
| | | | |
gilkalai.wordpress.com
|
|
| | | | | Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP and in coNP. See this post, and updates there in the comment section. Topology seminar,... | |
| | | | |
rjlipton.com
|
|
| | | | | A new way to write mathematics Vladimir Voevodsky won the Fields Medal in 2002 for his work on homotopy theory of algebraic varieties. Using his pioneering methods he proved, among many other things, a deep conjecture of John Milnor, that had been open for decades. Today I want to talk about, no, rant about, a... | |
| | | | |
quantumfrontiers.com
|
|
| | | Building Quantum Computers: A Practical Introduction by Shayan Majidy, Christopher Wilson, and Raymond Laflamme has been published by Cambridge University Press and will be released in the US on September 30. The authors invited me to write a Foreword for the book, which I was happy to do. The publisher kindly granted permission for me... | ||
