Correlation lower bounds from correlation upper bounds
From MaRDI portal
Publication:280948
DOI10.1016/j.ipl.2016.03.012zbMath1357.68079OpenAlexW2312325183MaRDI QIDQ280948
Periklis A. Papakonstantinou, Shiteng Chen
Publication date: 10 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.03.012
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Estimation of certain exponential sums arising in complexity theory
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Exponential sums and circuits with a single threshold gate and mod-gates
- A note on a theorem of Barrington, Straubing and Thérien
- Lower bounds for modular counting by circuits with modular gates
- A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits
- Bounds on an exponential sum arising in Boolean circuit complexity
- On the Power of Small-Depth Computation
- On the correlation of symmetric functions
- Lower Bounds for (MODp - MODm) Circuits
- Linear Systems over Composite Moduli
This page was built for publication: Correlation lower bounds from correlation upper bounds
