FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...