STOC
2009
ACM
15 years 3 days ago
2009
ACM
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-onsolid model of statistical physics. This model has been proposed...
STOC
2009
ACM
15 years 3 days ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
STOC
2009
ACM
15 years 3 days ago
2009
ACM
A distributed task T on n processors is an input/output relation between a collection of processors' inputs and outputs. While all tasks are solvable if no processor may ever...
STOC
2009
ACM
15 years 3 days ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
STOC
2009
ACM
15 years 3 days ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
STOC
2009
ACM
15 years 3 days ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
STOC
2009
ACM
15 years 3 days ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
STOC
2009
ACM
15 years 3 days ago
2009
ACM
Some, but not all, extractors resist adversaries with limited quantum storage. In this paper we show that Trevisan's extractor has this property, thereby showing an extractor...
STOC
2009
ACM
15 years 3 days ago
2009
ACM
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...
STOC
2009
ACM
15 years 3 days ago
2009
ACM
We put forward a new approach to mechanism design, and exemplify it via a new mechanism guaranteeing significant revenue in unrestricted combinatorial auctions. Our mechanism ? su...