Sciweavers

    STOC
    2010
    ACM
    224views Algorithms» more  STOC 2010»
    Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
    13 years 9 months ago
    Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
    Download  pages.cs.wisc.edu
    Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
    Holger Dell and Dieter van Melkebeek
    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.