Pages that link to "Item:Q3002829"
From MaRDI portal
The following pages link to Tight bounds on the average sensitivity of k-CNF (Q3002829):
Displaying 14 items.
- The average sensitivity of bounded-depth circuits (Q290255) (← links)
- Pseudo-average block sensitivity equals average sensitivity (Q293418) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Boolean nested canalizing functions: a comprehensive analysis (Q385051) (← links)
- On the average sensitivity of the weighted sum function (Q413263) (← links)
- The average sensitivity of square-freeness (Q1590081) (← links)
- The average sensitivity of bounded-depth formulas (Q1653335) (← links)
- Minterm-transitive functions with asymptotically smallest block sensitivity (Q1944206) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- On extremal \(k\)-CNF formulas (Q2509734) (← links)
- On extremal \(k\)-CNF formulas (Q2857316) (← links)
- Approximating Boolean Functions with Depth-2 Circuits (Q3451753) (← links)
- Criticality of regular formulas (Q5091751) (← links)
- The simplified weighted sum function and its average sensitivity (Q5964818) (← links)