Sciweavers

    2 search results - page 1 / 1
    » Counting good truth assignments of random k-SAT formulae
    Sort
    View
    CORR
    2006
    Springer
    123views Education» more  CORR 2006»
    Counting good truth assignments of random k-SAT formulae
    13 years 4 months ago
    Counting good truth assignments of random k-SAT formulae
    Download  web.mit.edu
    We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
    Andrea Montanari, Devavrat Shah
    claim paper
    Read More »
    AAAI
    2004
    137views Intelligent Agents» more  AAAI 2004»
    Hiding Satisfying Assignments: Two Are Better than One
    13 years 6 months ago
    Hiding Satisfying Assignments: Two Are Better than One
    Download  www.jair.org
    The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
    Dimitris Achlioptas, Haixia Jia, Cristopher Moore
    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.