ECCC

2007

13 years 7 months ago
2007

In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...

ECCC

2007

13 years 7 months ago
2007

ECCC

2007

13 years 7 months ago
2007

Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over ﬁnite ﬁelds. Pseudorandom generators against linear polynomials, known...

ECCC

2007

13 years 7 months ago
2007

The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisﬁable. We show that there is no reduction fr...

ECCC

2007

13 years 7 months ago
2007

ECCC

2007

13 years 7 months ago
2007

ECCC

2007

13 years 7 months ago
2007

A construction of Bourgain [Bou05] gave the ﬁrst 2-source extractor to break the min-entropy rate 1/2 barrier. In this note, we write an exposition of his result, giving a high ...

ECCC

2007

13 years 7 months ago
2007

Is it possible for two intelligent beings to communicate meaningfully, without any common language or background? This question has interest on its own, but is especially relevant...

ECCC

2007

13 years 7 months ago
2007

ECCC

2007

13 years 7 months ago
2007

We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...