Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > CORRELATION BOUND:
Reports tagged with correlation bound:
TR14-184 | 29th December 2014
Ruiwen Chen, Valentine Kabanets

Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits

We revisit the gate elimination method, generalize it to prove correlation bounds of boolean circuits with Parity, and also derive deterministic #SAT algorithms for small linear-size circuits. In particular, we prove that, for boolean circuits of size $3n - n^{0.51}$, the correlation with Parity is at most $2^{-n^{\Omega(1)}}$, and there ... more >>>




ISSN 1433-8092 | Imprint