Sciweavers

    2 search results - page 1 / 1
    » On the Power of Randomized Reductions and the Checkability o...
    Sort
    View
    COCO
    2010
    Springer
    125views Algorithms» more  COCO 2010»
    On the Power of Randomized Reductions and the Checkability of SAT
    15 years 7 months ago
    On the Power of Randomized Reductions and the Checkability of SAT
    Download  www.cs.princeton.edu
    Mohammad Mahmoody, David Xiao
    claim paper
    Read More »
    113
    Voted
    FSTTCS
    1992
    Springer
    98views Software Engineering» more  FSTTCS 1992»
    On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
    15 years 7 months ago
    On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
    Download  vts.uni-ulm.de
    In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
    Vikraman Arvind, Johannes Köbler, Martin Mund...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.