STOC
2010
ACM
2010
ACM
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem
13 years 9 months ago
STOC
2010
ACM
13 years 9 months ago
2010
ACM
STOC
2010
ACM
13 years 9 months ago
2010
ACM
STOC
2010
ACM
13 years 9 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
STOC
2010
ACM
13 years 9 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...