151 search results - page 1 / 31 » The Computational Complexity of Knot and Link Problems |
FOCS
1997
IEEE
13 years 9 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
DCG
2011
12 years 8 months ago
2011
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
WABI
2001
Springer
13 years 9 months ago
2001
Springer
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...