Sciweavers

    JSAT
    2006
    87views more  JSAT 2006»
    Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
    14 years 12 days ago
    Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
    Download  jsat.ewi.tudelft.nl
    A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
    Harri Haanpää, Matti Järvisalo, Pet...
    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-2024, USA.