Sciweavers

    ECCC
    1998
    105views more  ECCC 1998»
    Pseudorandom generators without the XOR Lemma
    13 years 11 months ago
    Pseudorandom generators without the XOR Lemma
    Download  people.csail.mit.edu
    Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
    Madhu Sudan, Luca Trevisan, Salil P. Vadhan
    claim paper
    Read More »
    TOC
    2008
    89views more  TOC 2008»
    Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
    13 years 11 months ago
    Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
    Download  www.math.ias.edu
    Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
    Emanuele Viola, Avi Wigderson
    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.