The following pages link to Affine extractors over prime fields (Q653998):
Displayed 15 items.
- Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759) (← links)
- Affine extractors over large fields with exponential error (Q347127) (← links)
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Improving the Hadamard extractor (Q1758168) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (Q2946392) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- Zero-Fixing Extractors for Sub-Logarithmic Entropy (Q3448797) (← links)
- From Affine to Two-Source Extractors via Approximate Duality (Q3451757) (← links)
- (Q5090431) (← links)
- Extractors and Lower Bounds for Locally Samplable Sources (Q5894225) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)