Sciweavers

    ECCC
    2016
    43views more  ECCC 2016»
    Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning
    8 years 26 days ago
    Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning
    Download  eprint.iacr.org
    We prove that any algorithm for learning parities requires either a memory of quadratic size or an exponential number of samples. This proves a recent conjecture of Steinhardt, Va...
    Ran Raz
    claim paper
    Read More »
    ECCC
    2016
    107views more  ECCC 2016»
    Autoreducibility of NP-Complete Sets
    8 years 26 days ago
    Autoreducibility of NP-Complete Sets
    Download  www.cs.uwyo.edu
    We study the polynomial-time autoreducibility of NP-complete sets and obtain separations under strong hypotheses for NP. Assuming there is a p-generic set in NP, we show the follo...
    John M. Hitchcock, Hadi Shafei
    claim paper
    Read More »
    ECCC
    2016
    57views more  ECCC 2016»
    On the Width of Semi-Algebraic Proofs and Algorithms
    8 years 26 days ago
    On the Width of Semi-Algebraic Proofs and Algorithms
    Download  people.cs.uchicago.edu
    In this paper we initiate the study of width in semi-algebraic proof systems and various cut-based procedures in integer programming. We focus on two important systems: Gomory-Chv...
    Alexander A. Razborov
    claim paper
    Read More »
    ECCC
    2016
    46views more  ECCC 2016»
    Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
    8 years 26 days ago
    Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
    Download  eprint.iacr.org
    The seminal result that every language having an interactive proof also has a zero-knowledge interactive proof assumes the existence of one-way functions. Ostrovsky and Wigderson ...
    Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, ...
    claim paper
    Read More »
    ECCC
    2016
    55views more  ECCC 2016»
    Identity Testing for constant-width, and commutative, read-once oblivious ABPs
    8 years 26 days ago
    Identity Testing for constant-width, and commutative, read-once oblivious ABPs
    Download  home.iitk.ac.in
    We give improved hitting-sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known variable order. The best...
    Rohit Gurjar, Arpita Korwar, Nitin Saxena
    claim paper
    Read More »
    ECCC
    2016
    49views more  ECCC 2016»
    Further extensions of Clifford circuits and their classical simulation complexities
    8 years 26 days ago
    Further extensions of Clifford circuits and their classical simulation complexities
    Download  www.scottaaronson.com
    Extended Clifford circuits, such as those in [1], straddle the boundary between classical and quantum computational power. Whether such circuits are efficiently classically simula...
    Dax Enshan Koh
    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.