Timeline for Computational complexity of Knot polynomials
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 26, 2012 at 0:01 | comment | added | Joseph O'Rourke | "The aim of these notes is to link algorithmic problems arising in knot theory with statistical physics and classical combinatorics. Apart from the theory of computational complexity needed to deal with enumeration problems, introductions are given to several of the topics, such as combinatorial knot theory, randomized approximation models, percolation, and random cluster models." Note: Written a decade ago, so possibly out of date on some topics. | |
| May 25, 2012 at 22:52 | vote | accept | Arnab | ||
| May 27, 2012 at 19:24 | |||||
| May 25, 2012 at 21:50 | history | answered | Igor Rivin | CC BY-SA 3.0 |