Sciweavers

    FOCS
    1997
    IEEE
    102views Theoretical Computer Science» more  FOCS 1997»
    The Computational Complexity of Knot and Link Problems
    14 years 10 months ago
    The Computational Complexity of Knot and Link Problems
    Download  graphics.stanford.edu
    We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
    Joel Hass, J. C. Lagarias, Nicholas Pippenger
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.