The following pages link to Ben lee Volk (Q2012183):
Displaying 15 items.
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- A lower bound on determinantal complexity (Q2087768) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- (Q4612482) (← links)
- Succinct hitting sets and barriers to proving algebraic circuits lower bounds (Q4978011) (← links)
- Pseudorandom Bits for Oblivious Branching Programs (Q5053059) (← links)
- A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- (Q5121899) (← links)
- Efficiently Decoding Reed–Muller Codes From Random Errors (Q5280877) (← links)
- Efficiently decoding Reed-Muller codes from random errors (Q5361832) (← links)
- (Q6115355) (← links)
- (Q6126356) (← links)
