ECCC 2010 | Sciweavers

31

click to vote

ECCC
2010

107views more ECCC 2010»

On the Sum of Square Roots of Polynomials and related problems

13 years 7 months ago

Download www.mpi-inf.mpg.de

Neeraj Kayal, Chandan Saha

claim paper

Read More »

34

click to vote

ECCC
2010

119views more ECCC 2010»

On beating the hybrid argument

13 years 7 months ago

Download www.cs.haifa.ac.il

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,...

claim paper

Read More »

32

click to vote

ECCC
2010

91views more ECCC 2010»

Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods

13 years 7 months ago

Download homepages.inf.ed.ac.uk

Maurice Jansen

claim paper

Read More »

34

click to vote

ECCC
2010

103views more ECCC 2010»

A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games

13 years 7 months ago

Download pages.cs.wisc.edu

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, ...

claim paper

Read More »

25

click to vote

ECCC
2010

90views more ECCC 2010»

Optimal bounds for sign-representing the intersection of two halfspaces by polynomials

13 years 7 months ago

Download kam.mff.cuni.cz

Alexander A. Sherstov

claim paper

Read More »

45

click to vote

ECCC
2010

124views more ECCC 2010»

A counterexample to the Alon-Saks-Seymour conjecture and related problems

13 years 7 months ago

Download www.math.ucla.edu

Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.

Hao Huang, Benny Sudakov

claim paper

Read More »

50

click to vote

ECCC
2010

153views more ECCC 2010»

Local list decoding with a constant number of queries

13 years 7 months ago

Download www.cs.tau.ac.il

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

claim paper

Read More »

35

click to vote

ECCC
2010

140views more ECCC 2010»

Query-Efficient Locally Decodable Codes

13 years 7 months ago

Download www.math.udel.edu

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,...

claim paper

Read More »

41

click to vote

ECCC
2010

147views more ECCC 2010»

A Note on Amplifying the Error-Tolerance of Locally Decodable Codes

13 years 7 months ago

Download www.cs.tau.ac.il

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

claim paper

Read More »

36

click to vote

ECCC
2010

107views more ECCC 2010»

Bypassing UGC from some optimal geometric inapproximability results

13 years 7 months ago