Pages that link to "Item:Q3158535"

The following pages link to The computational complexity of knot and link problems (Q3158535):

Displaying 50 items.

• On Jones' subgroup of R. Thompson group \(F\) (Q335596) (← links)
• A polynomial upper bound on Reidemeister moves (Q499087) (← links)
• Design tools for reporter strands and DNA origami scaffold strands (Q529038) (← links)
• Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
• Preserving computational topology by subdivision of quadratic and cubic Bézier curves (Q884743) (← links)
• Crosscap numbers and the Jones polynomial (Q890131) (← links)
• Fast algorithms for computing Jones polynomials of certain links (Q1022582) (← links)
• Morphing polyhedra with parallel faces: Counterexamples (Q1025295) (← links)
• Non-orientable fundamental surfaces in Lens spaces (Q1030175) (← links)
• Converting between quadrilateral and standard solution sets in normal surface theory (Q1035322) (← links)
• A new algorithm for recognizing the unknot (Q1279535) (← links)
• Models of random knots (Q1659256) (← links)
• Finding non-orientable surfaces in 3-manifolds (Q1688857) (← links)
• The intersection of subgroups in free groups and linear programming (Q1709789) (← links)
• Pole dancing: 3D morphs for tree drawings (Q1725773) (← links)
• Identifying lens spaces in polynomial time (Q1743503) (← links)
• The parametrized complexity of knot polynomials (Q1877705) (← links)
• The disjoint curve property (Q1882814) (← links)
• A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
• The efficient certification of knottedness and Thurston norm (Q2037601) (← links)
• On the hardness of finding normal surfaces (Q2063199) (← links)
• Traversing three-manifold triangulations and spines (Q2190077) (← links)
• Cuts for 3-D magnetic scalar potentials: visualizing unintuitive surfaces arising from trivial knots (Q2203573) (← links)
• Some conditionally hard problems on links and 3-manifolds (Q2411821) (← links)
• Maximal admissible faces and asymptotic bounds for the normal surface solution space (Q2431613) (← links)
• Knottedness is in NP, modulo GRH (Q2445896) (← links)
• The computational complexity of basic decision problems in 3-dimensional topology (Q2481645) (← links)
• The unbearable hardness of unknotting (Q2656151) (← links)
• The number of Reidemeister moves needed for unknotting (Q2701705) (← links)
• Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT (Q2819199) (← links)
• POST QUANTUM CRYPTOGRAPHY FROM MUTANT PRIME KNOTS (Q2893169) (← links)
• On the complexity of torus knot recognition (Q3120516) (← links)
• Optimizing the double description method for normal surface enumeration (Q3584785) (← links)
• Automata on Gauss Words (Q3618609) (← links)
• TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT (Q4549836) (← links)
• Normal and Jones surfaces of knots (Q4565309) (← links)
• Computing Heegaard Genus is NP-Hard (Q4604369) (← links)
• Alternating links have at most polynomially many Seifert surfaces of fixed genus (Q4994368) (← links)
• NP–hard problems naturally arising in knot theory (Q4997304) (← links)
• Rectangular knot diagrams classification with deep learning (Q5050613) (← links)
• Smoothing the Gap Between NP and ER (Q5071086) (← links)
• (Q5088981) (← links)
• Link crossing number is NP-hard (Q5118878) (← links)
• New presentations of a link and virtual link (Q5223426) (← links)
• Pole Dancing: 3D Morphs for Tree Drawings (Q5233136) (← links)
• The computational complexity of knot genus and spanning area (Q5469952) (← links)
• Detecting Unknots via Equational Reasoning, I: Exploration (Q5495915) (← links)
• A classification of slow convergence near parametric periodic points of discrete dynamical systems (Q5739595) (← links)
• Low complexity algorithms in knot theory (Q5742776) (← links)
• Tracing compressed curves in triangulated surfaces (Q5919981) (← links)