The following pages link to The complexity of distributions (Q2884580):
Displaying 18 items.
- An approximate distribution for the maximum order complexity (Q676727) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Local expanders (Q1653336) (← links)
- Bi-Lipschitz bijection between the Boolean cube and the Hamming ball (Q2630133) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- (Q2941646) (← links)
- (Q3031890) (← links)
- On the complexity of circulations (Q3740229) (← links)
- Malign distributions for average case circuit complexity (Q4596659) (← links)
- On Lipschitz Bijections Between Boolean Functions (Q4635511) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- (Q4796316) (← links)
- The Complexity and Distribution of Hard Problems (Q4834381) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- (Q5875509) (← links)
- On mappings on the hypercube with small average stretch (Q5885200) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)