113
Voted
ECCC
2010
14 years 10 months ago
2010
127
Voted
ECCC
2010
14 years 10 months ago
2010
The hybrid argument allows one to relate the distinguishability of a distribution (from uniform) to the predictability of individual bits given a prefix. The argument incurs a los...
112
Voted
ECCC
2010
14 years 10 months ago
2010
142
Voted
ECCC
2010
14 years 10 months ago
2010
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
112
Voted
ECCC
2010
14 years 10 months ago
2010
143
Voted
ECCC
2010
14 years 10 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
173
Voted
ECCC
2010
14 years 10 months ago
2010
Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...
127
Voted
ECCC
2010
14 years 10 months ago
2010
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
152
Voted
ECCC
2010
14 years 10 months ago
2010
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setti...
112
Voted
ECCC
2010
14 years 10 months ago
2010
