The following pages link to (Q3139759):
Displaying 10 items.
- The complexity of lattice knots (Q1295201) (← links)
- Complexity of protein folding (Q1319880) (← links)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- Unexpected local minima in the width complexes for knots (Q2431289) (← links)
- Knottedness is in NP, modulo GRH (Q2445896) (← links)
- The number of Reidemeister moves needed for unknotting (Q2701705) (← links)
- The Unknotting Problem (Q2826811) (← links)
- (Q3140234) (← links)
- Intrinsic linking and knotting are arbitrarily complex (Q3530834) (← links)
- The computational complexity of knot genus and spanning area (Q5469952) (← links)