Sciweavers

    STOC
    1989
    ACM
    66views Algorithms» more  STOC 1989»

    The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial

    14 years 3 months ago
    The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
    Download  users.soe.ucsc.edu
    Leonard Pitt, Manfred K. Warmuth
    claim paper
    Added 11 Aug 2010
    Updated 11 Aug 2010
    Type Conference
    Year 1989
    Where STOC
    Authors Leonard Pitt, Manfred K. Warmuth
    Comments (0)
    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-2024, USA.