The Computational Complexity of Knot and Link Problems (1997)

by Joel Hass , Jeffrey C. Lagarias
Citations:57 - 8 self

Active Bibliography

6 The computational complexity of knot genus and spanning area – Ian Agol, Joel Hass, William Thurston
2359 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
852 Planning and acting in partially observable stochastic domains – Leslie Pack Kaelbling, Michael L. Littman, Anthony R. Cassandra - 1998
1324 Reinforcement learning: a survey – Leslie Pack Kaelbling, Michael L. Littman, Andrew W. Moore - 1996
778 Logical foundations of object-oriented and frame-based languages – Michael Kifer, Georg Lausen, James Wu - 1995
1216 Factor Graphs and the Sum-Product Algorithm – Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger - 1998
513 How bad is selfish routing? – Tim Roughgarden, √Čva Tardos - 2002
540 An Integrated Experimental Environment for Distributed Systems and Networks – Brian White, Jay Lepreau, Leigh Stoller, Robert Ricci, Shashi Guruprasad, Mac Newbold, Mike Hibler, Chad Barb, Abhijeet Joglekar - 2002
802 Applied Cryptography -- Protocols, Algorithms, and . . . – Bruce Schneier