153
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
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...
126
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n