|
You are here |
0fps.net | ||
| | | | |
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,... | |
| | | | |
www.qri.org
|
|
| | | | | Content Warning: Trying to understand the contents of this essay may be mindwarping. Proceed with caution. | |
| | | | |
mycqstate.wordpress.com
|
|
| | | | | Boris Tsirelson (or Cirel'son, or ?, or ?) is an Israeli (born Russian) mathematician currently at Tel-Aviv university. Here is the picture from his Wikipedia entry: he has such an incredible stare, he irresistibly reminds me of Orson Welles (picture below). Two great magicians! Tsirelson worked on the mathematical foundations of nonlocality in the early... | |
| | | | |
eccc.hpi-web.de
|
|
| | | Homepage of the Electronic Colloquium on Computational Complexity located at the Weizmann Institute of Science, Israel | ||