Sciweavers

ECCC
2007
147views more  ECCC 2007»
13 years 11 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
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...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
ECCC
2007
89views more  ECCC 2007»
13 years 11 months ago
The black-box query complexity of polynomial summation
Ali Juma, Valentine Kabanets, Charles Rackoff, Ami...
ECCC
2007
100views more  ECCC 2007»
13 years 11 months ago
Unconditional pseudorandom generators for low degree polynomials
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
Shachar Lovett
ECCC
2007
122views more  ECCC 2007»
13 years 11 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
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 satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
ECCC
2007
57views more  ECCC 2007»
13 years 11 months ago
Equilibria of Graphical Games with Symmetries
Felix Brandt, Felix A. Fischer, Markus Holzer
ECCC
2007
115views more  ECCC 2007»
13 years 11 months ago
An Exposition of Bourgain's 2-Source Extractor
A construction of Bourgain [Bou05] gave the first 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 ...
Anup Rao
ECCC
2007
127views more  ECCC 2007»
13 years 11 months ago
Universal Semantic Communication I
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...
Brendan Juba, Madhu Sudan
ECCC
2007
82views more  ECCC 2007»
13 years 11 months ago
Extending Polynomial Calculus to $k$-DNF Resolution
Nicola Galesi, Massimo Lauria
ECCC
2007
124views more  ECCC 2007»
13 years 11 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
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...
Artur Czumaj, Asaf Shapira, Christian Sohler