Sciweavers

    STOC
    1999
    ACM
    81views Algorithms» more  STOC 1999»
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability
    13 years 9 months ago
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability
    Download  www.cs.huji.ac.il
    This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
    Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, S...
    claim paper
    Read More »
    STOC
    1999
    ACM
    75views Algorithms» more  STOC 1999»
    Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes
    13 years 9 months ago
    Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes
    Download  www.math.ucsd.edu
    Samuel R. Buss, Dima Grigoriev, Russell Impagliazz...
    claim paper
    Read More »
    STOC
    1999
    ACM
    74views Algorithms» more  STOC 1999»
    Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
    13 years 9 months ago
    Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
    Download  www.cs.ucla.edu
    Allan Borodin, Rafail Ostrovsky, Yuval Rabani
    claim paper
    Read More »
    STOC
    1999
    ACM
    80views Algorithms» more  STOC 1999»
    Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems
    13 years 9 months ago
    Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems
    Download  www.cs.ucla.edu
    Allan Borodin, Rafail Ostrovsky, Yuval Rabani
    claim paper
    Read More »
    STOC
    1999
    ACM
    176views Algorithms» more  STOC 1999»
    On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
    13 years 9 months ago
    On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
    Download  www.csie.nuk.edu.tw
    Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
    Johannes Blömer, Jean-Pierre Seifert
    claim paper
    Read More »
    STOC
    1999
    ACM
    101views Algorithms» more  STOC 1999»
    Short Proofs are Narrow - Resolution Made Simple
    13 years 9 months ago
    Short Proofs are Narrow - Resolution Made Simple
    Download  www.cs.helsinki.fi
    The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
    Eli Ben-Sasson, Avi Wigderson
    claim paper
    Read More »
    « first‹ previous12
    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.