On the Correlation of Parity and Small-Depth Circuits
From MaRDI portal
Publication:5173252
Cited in
(31)- Gate elimination: circuit size lower bounds and \#SAT upper bounds
- Fourier concentration from shrinkage
- Expander-based cryptography meets natural proofs
- Fine-Grained Cryptography
- Bounded indistinguishability and the complexity of recovering secrets
- Approximating Boolean functions with depth-2 circuits
- On polynomial approximations to \(\mathrm{AC}^0\)
- What circuit classes can be learned with non-trivial savings?
- Bounded independence plus noise fools products
- Tree tribes and lower bounds for switching lemmas
- Luby-Veličković-Wigderson revisited: improved correlation bounds and pseudorandom generators for depth-two circuits
- Quantified Derandomization: How to Find Water in the Ocean
- scientific article; zbMATH DE number 7528580 (Why is no real title available?)
- Criticality of regular formulas
- A unified method for placing problems in polylogarithmic depth
- Sampling lower bounds: Boolean average-case and permutations
- Improved pseudorandom generators from pseudorandom multi-switching lemmas
- Unconditionally secure computation against low-complexity leakage
- Correction to: ``Unconditionally secure computation against low-complexity leakage
- Unconditionally secure NIZK in the fine-grained setting
- Paradigms for Unconditional Pseudorandom Generators
- Limits of preprocessing
- On small-depth frege proofs for \textsf{PHP}
- A technique for hardness amplification against AC^0
- Average-case deterministic query complexity of Boolean functions with fixed weight
- Towards stronger depth lower bounds
- On bounded depth proofs for Tseitin formulas on the grid; revisited
- Range avoidance for low-depth circuits and connections to pseudorandomness
- Comparing computational entropies below majority (or: when is the dense model theorem false?)
- Shrinkage of decision lists and DNF formulas
- Average-case query complexity of fixed-weight Boolean functions and k-CNFs
This page was built for publication: On the Correlation of Parity and Small-Depth Circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173252)
