Explore >> Select a destination
|
You are here 
|
blog.computationalcomplexity.org | ||
| | | | |
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,... | |
| | | | |
blog.geomblog.org
|
|
| | | | | It's job talk season around the country, and this note from +Lance Fortnow popped up on my twitter feed. If you give a job talk to a ... | |
| | | | |
rjlipton.com
|
|
| | | | | Connections in mathematics: games and graphs John Nash is famous for his creation of what has become one of the central notions of modern game theory---his concept of what is a ``solution" for a non-zero sum game. For this work he was awarded the Nobel Prize in Economic Sciences in 1994, along with John Harsanyi... | |
| | | | |
vikashkodati.com
|
|
| | | I have been meaning to connect these dots for a while and this weekend took up to task to pen down the first draft Nobel Prize in Physics 2022 on Entanglement The Nobel Prize in Physics 2022 was awarded jointly to Alain Aspect, John F. Clauser and Anton Zeilinger "for experiments with entangled photons, establishing... | ||
