Correlation lower bounds from correlation upper bounds
From MaRDI portal
Publication:280948
DOI10.1016/J.IPL.2016.03.012zbMATH Open1357.68079OpenAlexW2312325183MaRDI QIDQ280948FDOQ280948
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
Recommendations
- A practical way for computing approximate lower and upper correlations bounds
- scientific article; zbMATH DE number 2107693
- The best lower bound of sample correlation coefficient with ordered restriction
- Correlation Inequalities
- On the lower limit for possibilistic correlation coefficient with identical marginal possibility distributions
- Higher correlation inequalities
- Bound on FWER for correlated normal
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- 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
- Estimation of certain exponential sums arising in complexity theory
Cited In (3)
This page was built for publication: Correlation lower bounds from correlation upper bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280948)
