Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT
From MaRDI portal
Publication:2819199
DOI10.1007/978-3-319-42432-3_7zbMath1354.68278OpenAlexW2505656494MaRDI QIDQ2819199
David Stanovský, Andrew Fish, Sarah Swartwood, Alexej P. Lisitsa
Publication date: 28 September 2016
Published in: Mathematical Software – ICMS 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-42432-3_7
Uses Software
Cites Work
- Unnamed Item
- Untangling DNA
- Knottedness is in NP, modulo GRH
- Quandle colorings of knots and applications
- The computational complexity of knot and link problems
- On the computational complexity of the Jones and Tutte polynomials
- Recognition algorithms in knot theory
- Detecting Unknots via Equational Reasoning, I: Exploration