Explore >> Select a destination
|
You are here 
|
rjlipton.com | ||
| | | | |
experimentalmath.info
|
|
| | | | | ||
| | | | |
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,... | |
| | | | |
micromath.wordpress.com
|
|
| | | | | Visit the post for more. | |
| | | | |
ropmann.wordpress.com
|
|
| | | Visit the post for more. | ||
