The following pages link to Christopher Umans (Q354641):
Displaying 30 items.
- On sunflowers and matrix multiplication (Q354642) (← links)
- The complexity of Boolean formula minimization (Q619911) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- On the complexity of succinct zero-sum games (Q1024660) (← links)
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
- On the complexity of approximating the VC dimension. (Q1872731) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- Pseudorandomness for approximate counting and sampling (Q2460030) (← links)
- Lossless condensers, unbalanced expanders, and extractors (Q2460624) (← links)
- On beating the hybrid argument (Q2826078) (← links)
- (Q3191596) (← links)
- Fast Polynomial Factorization and Modular Composition (Q3225172) (← links)
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes (Q3452216) (← links)
- The Complexity of Boolean Formula Minimization (Q3521905) (← links)
- Algorithms for Playing Games with Limited Randomness (Q3527224) (← links)
- Simple extractors for all min-entropies and a new pseudorandom generator (Q3546310) (← links)
- (Q3549642) (← links)
- Low-End Uniform Hardness versus Randomness Tradeoffs for AM (Q3575157) (← links)
- The Complexity of Rationalizing Matchings (Q3596716) (← links)
- (Q4938653) (← links)
- The Complexity of Rationalizing Network Formation (Q5171214) (← links)
- Loss-less condensers, unbalanced expanders, and extractors (Q5175962) (← links)
- (Q5278342) (← links)
- (Q5302071) (← links)
- On Obtaining Pseudorandomness from Error-Correcting Codes (Q5385977) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479392) (← links)
- Fast matrix multiplication using coherent configurations (Q5741785) (← links)
- Theory and Applications of Models of Computation (Q5898889) (← links)
- Pseudo-random generators for all hardnesses (Q5901058) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
