|
Organizers |
Knots, Quandles, and the Constraint Satisfaction Problem
by
Robert W. McGrail
Bard College
Coauthors: Peter Golbus, Mona Merling, Ken Ober, Japheth Wood
This is an overview of the current state of the Quandle Dichotomy Project within the Laboratory for Algebraic and Symbolic Computation at Bard College. In particular, the relations between quandles and constraint languages, and constraint satisfaction and nondeterministic polynomial time will be explored. Through these connections, a natural notion for the computational complexity of knots will be constructed.
Date received: October 23, 2007
Copyright © 2007 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cavo-04.