management | Sciweavers

: 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 »

47

click to vote

TOC
2010

132views Management» more TOC 2010»

Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games

13 years 6 months ago

Download toc.cse.iitk.ac.in

Avrim Blum, Eyal Even-Dar, Katrina Ligett

claim paper

Read More »

41

click to vote

TOC
2010

147views Management» more TOC 2010»

Quantum Expanders: Motivation and Construction

13 years 6 months ago

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 »

45

click to vote

TOC
2010

127views Management» more TOC 2010»

The Submodular Welfare Problem with Demand Queries

13 years 6 months ago

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 »

52

click to vote

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

13 years 6 months ago

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 »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers