Sciweavers

SODA
2012
ACM
245views Algorithms» more  SODA 2012»
12 years 1 months ago
Sketching valuation functions
Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More...
Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu,...
SIAMCOMP
2008
130views more  SIAMCOMP 2008»
13 years 11 months ago
Short PCPs with Polylog Query Complexity
We give constructions of probabilistically checkable proofs (PCPs) of length n
Eli Ben-Sasson, Madhu Sudan