Sciweavers

ECCC
2007
79views more  ECCC 2007»
13 years 4 months ago
Testing the Expansion of a Graph
Asaf Nachmias, Asaf Shapira
ECCC
2007
69views more  ECCC 2007»
13 years 4 months ago
Testing Symmetric Properties of Distributions
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
Paul Valiant
ECCC
2007
96views more  ECCC 2007»
13 years 4 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
ECCC
2007
59views more  ECCC 2007»
13 years 4 months ago
Improved approximation algorithms for directed Steiner forest
Sharon Feldman, Guy Kortsarz, Zeev Nutov
ECCC
2007
99views more  ECCC 2007»
13 years 4 months ago
On the Average-Case Complexity of Property Testing
Abstract. Motivated by a study of Zimand (22nd CCC, 2007), we consider the average-case complexity of property testing (focusing, for clarity, on testing properties of Boolean stri...
Oded Goldreich
ECCC
2007
90views more  ECCC 2007»
13 years 4 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider