Sciweavers

    2 search results - page 1 / 1
    » Extending Polynomial Calculus to $k$-DNF Resolution
    Sort
    View
    ECCC
    2007
    82views more  ECCC 2007»
    Extending Polynomial Calculus to $k$-DNF Resolution
    13 years 4 months ago
    Extending Polynomial Calculus to $k$-DNF Resolution
    Download  www.dsi.uniroma1.it
    Nicola Galesi, Massimo Lauria
    claim paper
    Read More »
    MST
    2010
    105views more  MST 2010»
    On the Automatizability of Polynomial Calculus
    13 years 3 months ago
    On the Automatizability of Polynomial Calculus
    Download  www.dsi.uniroma1.it
    Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
    Nicola Galesi, Massimo Lauria
    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.