Sciweavers

    RSA
    2006
    104views more  RSA 2006»
    The satisfiability threshold for randomly generated binary constraint satisfaction problems
    14 years 2 months ago
    The satisfiability threshold for randomly generated binary constraint satisfaction problems
    Download  www.math.cmu.edu
    Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
    Alan M. Frieze, Michael Molloy
    claim paper
    Read More »
    COCO
    2005
    Springer
    150views Algorithms» more  COCO 2005»
    The Quantum Adversary Method and Classical Formula Size Lower Bounds
    14 years 8 months ago
    The Quantum Adversary Method and Classical Formula Size Lower Bounds
    Download  www1.cs.columbia.edu
    We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
    Sophie Laplante, Troy Lee, Mario Szegedy
    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-2025, USA.