Sciweavers

ECCC
2016
43views more  ECCC 2016»
8 years 7 months ago
Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning
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...
Ran Raz
ECCC
2016
107views more  ECCC 2016»
8 years 7 months ago
Autoreducibility of NP-Complete Sets
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...
John M. Hitchcock, Hadi Shafei
ECCC
2016
57views more  ECCC 2016»
8 years 7 months ago
On the Width of Semi-Algebraic Proofs and Algorithms
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...
Alexander A. Razborov
ECCC
2016
46views more  ECCC 2016»
8 years 7 months ago
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
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 ...
Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, ...
ECCC
2016
55views more  ECCC 2016»
8 years 7 months ago
Identity Testing for constant-width, and commutative, read-once oblivious ABPs
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...
Rohit Gurjar, Arpita Korwar, Nitin Saxena
ECCC
2016
49views more  ECCC 2016»
8 years 7 months ago
Further extensions of Clifford circuits and their classical simulation complexities
Extended Clifford circuits, such as those in [1], straddle the boundary between classical and quantum computational power. Whether such circuits are efficiently classically simula...
Dax Enshan Koh