Sciweavers

ECCC
2010
119views more  ECCC 2010»
12 years 12 months ago
On beating the hybrid argument
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...
Bill Fefferman, Ronen Shaltiel, Christopher Umans,...
ECCC
2010
103views more  ECCC 2010»
12 years 12 months ago
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games
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...
Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, ...
ECCC
2010
124views more  ECCC 2010»
12 years 12 months ago
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
Hao Huang, Benny Sudakov
ECCC
2010
153views more  ECCC 2010»
12 years 12 months ago
Local list decoding with a constant number of queries
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...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
ECCC
2010
140views more  ECCC 2010»
12 years 12 months ago
Query-Efficient Locally Decodable Codes
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...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
ECCC
2010
147views more  ECCC 2010»
12 years 12 months ago
A Note on Amplifying the Error-Tolerance of Locally Decodable Codes
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...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
ECCC
2010
107views more  ECCC 2010»
12 years 12 months ago
Bypassing UGC from some optimal geometric inapproximability results
Venkatesan Guruswami, Prasad Raghavendra, Rishi Sa...