Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computational-topology
Search options not deleted
user 5010
Computational topology is the study of decidability problems in topology and the algorithms that determine decidability. Examples of area of study include Normal Surface theory and the subproblems of unknot and $S^3$ recognition.
41
votes
What part is left unsolved in the Unknotting problem? (after results of Bar-Natan, Khovanov,...
To strengthen Sam Nead's answer, note that it is trivial to compute the Jones polynomial from the Khovanov homology. It is known that computing (or even approximating) the Jones polynomial is #P-hard: …
- 10.1k
24
votes
What part is left unsolved in the Unknotting problem? (after results of Bar-Natan, Khovanov,...
This isn't directly what you ask, but it's also worth noting that unknot detection is in $\text{NP} \cap \text{co-NP}$, that is, there are polynomial-checkable certificates that will show that either …
- 10.1k