41 search results - page 4 / 9 » eccc 2007 |
108
click to vote
ECCC
2007
14 years 12 months ago
2007
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...
ECCC
2007
14 years 12 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
ECCC
2007
14 years 12 months ago
2007
We give a self-contained exposition of selected results in additive combinatorics over the group GF(2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Bal...
ECCC
2007
14 years 12 months ago
2007
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 ...
ECCC
2007
14 years 12 months ago
2007
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...