The following pages link to Fengming Wang (Q260397):
Displayed 10 items.
- On the power of algebraic branching programs of width two (Q260398) (← links)
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Robustness of PSPACE-complete sets (Q2379952) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth (Q3010398) (← links)
- On the Power of Algebraic Branching Programs of Width Two (Q3012846) (← links)
- (Q3099032) (← links)
- Uniform Derandomization from Pathetic Lower Bounds (Q3588422) (← links)
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws (Q3613771) (← links)