The following pages link to A. Wigderson (Q178716):
Displaying 50 items.
- Restriction access (Q2826041) (← links)
- The Gödel phenomenon in mathematics: a modern view (Q2856504) (← links)
- Partial derivatives in arithmetic complexity and beyond (Q2872492) (← links)
- Public-key cryptography from different assumptions (Q2875143) (← links)
- Sylvester-Gallai type theorems for approximate collinearity (Q2879416) (← links)
- Improved rank bounds for design matrices and a new proof of Kelly's theorem (Q2879417) (← links)
- Randomness extractors -- applications and constructions (Q2920153) (← links)
- Randomness -- a computational complexity perspective (Q2929280) (← links)
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction (Q2931427) (← links)
- Sum-of-squares Lower Bounds for Planted Clique (Q2941492) (← links)
- Reed-Muller Codes for Random Erasures and Errors (Q2941518) (← links)
- Algebrization (Q2947539) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Reed–Muller Codes for Random Erasures and Errors (Q2977204) (← links)
- Non-commutative arithmetic circuits with division (Q2988867) (← links)
- Iterative construction of Cayley expander graphs (Q3002767) (← links)
- The randomized communication complexity of set disjointness (Q3002788) (← links)
- (Q3002792) (← links)
- Norms, XOR lemmas, and lower bounds for polynomials and protocols (Q3002796) (← links)
- Monotone expanders: constructions and applications (Q3002825) (← links)
- On the Circuit Complexity of Perfect Hashing (Q3088172) (← links)
- Simplified Derandomization of BPP Using a Hitting Set Generator (Q3088176) (← links)
- On Yao’s XOR-Lemma (Q3088189) (← links)
- Kakeya Sets, New Mergers, and Old Extractors (Q3093623) (← links)
- Space Complexity in Propositional Calculus (Q3149864) (← links)
- Extractors and pseudo-random generators with optimal seed length (Q3191965) (← links)
- Space complexity in propositional calculus (Q3192004) (← links)
- (Q3212276) (← links)
- Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization (Q3295273) (← links)
- Succinct representations of graphs (Q3325058) (← links)
- (Q3325624) (← links)
- (Q3413301) (← links)
- Non-commutative arithmetic circuits with division (Q3467518) (← links)
- Monotone Circuits for Connectivity Require Super-Logarithmic Depth (Q3472058) (← links)
- Toward Understanding Exclusive Read (Q3474893) (← links)
- Linear Circuits over $\operatorname{GF}(2)$ (Q3496345) (← links)
- Randomness – A Computational Complexity Perspective (Q3503618) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Pairwise Independence and Derandomization (Q3522268) (← links)
- The Power and Weakness of Randomness in Computation (Q3525743) (← links)
- Euclidean Sections of $\ell_1^N$ with Sublinear Randomness and Error-Correction over the Reals (Q3541811) (← links)
- Randomness conductors and constant-degree lossless expanders (Q3579250) (← links)
- Expanders from symmetric codes (Q3579251) (← links)
- Derandomizing homomorphism testing in general groups (Q3580987) (← links)
- A new family of Cayley expanders (?) (Q3580989) (← links)
- Depth through breadth, or why should we attend talks in other areas? (Q3580994) (← links)
- Extractors (Q3581258) (← links)
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (Q3581280) (← links)
- Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized (Q3586194) (← links)
- Robust Local Testability of Tensor Products of LDPC Codes (Q3595411) (← links)
