79
Voted
ECCC
2016
10 years 1 months ago
2016
We prove that any algorithm for learning parities requires either a memory of quadratic size or an exponential number of samples. This proves a recent conjecture of Steinhardt, Va...
120
Voted
ECCC
2016
10 years 1 months ago
2016
We study the polynomial-time autoreducibility of NP-complete sets and obtain separations under strong hypotheses for NP. Assuming there is a p-generic set in NP, we show the follo...
68
Voted
ECCC
2016
10 years 1 months ago
2016
In this paper we initiate the study of width in semi-algebraic proof systems and various cut-based procedures in integer programming. We focus on two important systems: Gomory-Chv...
78
Voted
ECCC
2016
10 years 1 months ago
2016
The seminal result that every language having an interactive proof also has a zero-knowledge interactive proof assumes the existence of one-way functions. Ostrovsky and Wigderson ...
71
Voted
ECCC
2016
10 years 1 months ago
2016
We give improved hitting-sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known variable order. The best...