STOC
2010
ACM
15 years 1 months ago
2010
ACM
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
STOC
2010
ACM
15 years 1 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
STOC
2010
ACM
15 years 1 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
STOC
2010
ACM
15 years 1 months ago
2010
ACM
We construct a new public key encryption based on two assumptions:
STOC
2010
ACM
15 years 1 months ago
2010
ACM
STOC
2010
ACM
15 years 1 months ago
2010
ACM
STOC
2010
ACM
15 years 1 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
STOC
2010
ACM
15 years 1 months ago
2010
ACM
STOC
2010
ACM
15 years 1 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
STOC
2010
ACM
15 years 1 months ago
2010
ACM