The following pages link to A. Wigderson (Q178716):
Displaying 50 items.
- Pseudorandom Generators in Propositional Proof Complexity (Q4651526) (← links)
- Explicit Capacity Approaching Coding for Interactive Communication (Q4682935) (← links)
- The Tree Model for Hashing: Lower and Upper Bounds (Q4714553) (← links)
- (Q4725777) (← links)
- Search Problems in the Decision Tree Model (Q4764348) (← links)
- Simple analysis of graph tests for linearity and PCP (Q4800393) (← links)
- (Q4826684) (← links)
- Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy (Q4863976) (← links)
- Boolean complexity classes vs. their arithmetic analogs (Q4894604) (← links)
- An Asymptotic Bound on the Composition Number of Integer Sums of Squares Formulas (Q4908896) (← links)
- New Direct-Product Testers and 2-Query PCPs (Q4910583) (← links)
- Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
- (Q5028363) (← links)
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5090407) (← links)
- The complexity of graph connectivity (Q5096823) (← links)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
- Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
- Fractional Sylvester–Gallai theorems (Q5170981) (← links)
- Linear Systems over Composite Moduli (Q5171161) (← links)
- New direct-product testers and 2-query PCPs (Q5172706) (← links)
- Expanders that beat the eigenvalue bound (Q5248492) (← links)
- Characterizing non-deterministic circuit size (Q5248523) (← links)
- On derandomizing algorithms that err extremely rarely (Q5259544) (← links)
- Toward better formula lower bounds (Q5259555) (← links)
- Breaking the quadratic barrier for 3-LCC's over the reals (Q5259614) (← links)
- (Q5302082) (← links)
- (Q5302098) (← links)
- (Q5368747) (← links)
- Proof Complexity Lower Bounds from Algebraic Circuit Complexity (Q5368766) (← links)
- An <i>O</i> (log( <i>n</i> ) <sup>4/3</sup> ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs (Q5385338) (← links)
- Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes (Q5419122) (← links)
- (Q5421717) (← links)
- Extracting Randomness via Repeated Condensing (Q5470730) (← links)
- Interactive proofs of proximity (Q5495850) (← links)
- Extracting Randomness Using Few Independent Sources (Q5757459) (← links)
- Derandomizing Homomorphism Testing in General Groups (Q5757462) (← links)
- The uncertainty principle: Variations on a theme (Q5854480) (← links)
- Non-commutative circuits and the sum-of-squares problem (Q5891429) (← links)
- Non-commutative circuits and the sum-of-squares problem (Q5892594) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900934) (← links)
- Simulating independence (Q5901033) (← links)
- Simulating independence (Q5901100) (← links)
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents (Q5932755) (← links)
- Depth-3 arithmetic circuits over fields of characteristic zero (Q5957088) (← links)
- Connections between graphs and matrix spaces (Q6074039) (← links)
- Good permutation codes based on the shuffle-exchange network (Q6076193) (← links)
- On the power and limitations of branch and cut (Q6115357) (← links)
- Robustly self-ordered graphs: constructions and applications to property testing (Q6115365) (← links)
- (Q6115395) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
