Sciweavers

    JCSS
    2011
    75views more  JCSS 2011»

    The complexity of Boolean formula minimization

    13 years 7 months ago
    The complexity of Boolean formula minimization
    Download  www.cs.caltech.edu
    David Buchfuhrer, Christopher Umans
    claim paper
    Added 14 May 2011
    Updated 14 May 2011
    Type Journal
    Year 2011
    Where JCSS
    Authors David Buchfuhrer, Christopher Umans
    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.