Sciweavers

    TOC
    2010
    142views Management» more  TOC 2010»
    Decision Trees and Influence: an Inductive Proof of the OSSS Inequality
    12 years 11 months ago
    Decision Trees and Influence: an Inductive Proof of the OSSS Inequality
    Download  theoryofcomputing.org
    : We give a simple proof of the OSSS inequality (O'Donnell, Saks, Schramm, Servedio, FOCS 2005). The inequality states that for any decision tree T calculating a Boolean funct...
    Homin K. Lee
    claim paper
    Read More »
    TOC
    2010
    132views Management» more  TOC 2010»
    Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games
    12 years 11 months ago
    Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games
    Download  toc.cse.iitk.ac.in
    Avrim Blum, Eyal Even-Dar, Katrina Ligett
    claim paper
    Read More »
    TOC
    2010
    147views Management» more  TOC 2010»
    Quantum Expanders: Motivation and Construction
    12 years 11 months ago
    Quantum Expanders: Motivation and Construction
    Download  www.theoryofcomputing.org
    : We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
    Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
    claim paper
    Read More »
    TOC
    2010
    127views Management» more  TOC 2010»
    The Submodular Welfare Problem with Demand Queries
    12 years 11 months ago
    The Submodular Welfare Problem with Demand Queries
    Download  theory.stanford.edu
    : We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
    Uriel Feige, Jan Vondrák
    claim paper
    Read More »
    TOC
    2010
    155views Management» more  TOC 2010»
    A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
    12 years 11 months ago
    A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
    Download  cs.anu.edu.au
    Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
    Andris Ambainis
    claim paper
    Read More »
    TOC
    2010
    123views Management» more  TOC 2010»
    Rounds vs. Queries Tradeoff in Noisy Computation
    12 years 11 months ago
    Rounds vs. Queries Tradeoff in Noisy Computation
    Download  theoryofcomputing.org
    : We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
    Navin Goyal, Michael Saks
    claim paper
    Read More »
    TOC
    2010
    106views Management» more  TOC 2010»
    Separating Deterministic from Randomized Multiparty Communication Complexity
    12 years 11 months ago
    Separating Deterministic from Randomized Multiparty Communication Complexity
    Download  www.cs.toronto.edu
    Paul Beame, Matei David, Toniann Pitassi, Philipp ...
    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.