The following pages link to Pseudorandomness from Shrinkage (Q5244384):
Displaying 22 items.
- An improved deterministic \#SAT algorithm for small De Morgan formulas (Q334923) (← links)
- Negation-limited formulas (Q729897) (← links)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (Q2946392) (← links)
- Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound (Q2963581) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- (Q5077146) (← links)
- (Q5091189) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- Hardness magnification near state-of-the-art lower bounds (Q5091779) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- (Q5875501) (← links)
- Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
- One-tape Turing machine and branching program lower bounds for MCSP (Q6614616) (← links)
