Pages that link to "Item:Q5173252"
From MaRDI portal
The following pages link to On the Correlation of Parity and Small-Depth Circuits (Q5173252):
Displaying 20 items.
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Approximating Boolean Functions with Depth-2 Circuits (Q3451753) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- (Q5005174) (← links)
- (Q5009555) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- (Q5077146) (← links)
- Criticality of regular formulas (Q5091751) (← links)
- (Q5136328) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- (Q5875501) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5918097) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5925544) (← links)
- Limits of preprocessing (Q6581870) (← links)
