Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT (Q2819199): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2997089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quandle colorings of knots and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition algorithms in knot theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Unknots via Equational Reasoning, I: Exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of knot and link problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knottedness is in NP, modulo GRH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling DNA / rank
 
Normal rank

Latest revision as of 15:45, 12 July 2024

scientific article
Language Label Description Also known as
English
Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT
scientific article

    Statements

    Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    computational topology
    0 references
    knot detection and equivalence
    0 references
    SAT and \#-SAT solving
    0 references
    quandle coloring
    0 references
    0 references
    0 references
    0 references