Avi Wigderson
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 7 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Matrix Multiplication, And The Asymptotic Spectrum Of Tensors | Optimization Under Symmetry 2021 | 2021-11-29 |
Survey revives Strassen's asymptotic spectra theory, frames tensors as a preordered semiring and proves a strong duality: asymptotic rank equals the maximum… | ||
| (Hidden) Symmetries of Computational Problems | Geometric Methods in Optimization and Sampling Boot Camp | 2021-08-30 |
Provides a polynomial-time algorithm for the non‑commutative singularity problem by converting it to an operator scaling instance and running an… | ||
| (Hidden) Symmetries of Computational Problems (continued) | Geometric Methods in Optimization and Sampling Boot Camp | 2021-08-30 |
Claims that geodesic convexity explains why greedy scaling (e.g., Sinkhorn) works, and that three problems — nullcone membership, norm minimization (capacity)… | ||
| Are we aging well? | 50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing | 2021-02-11 |
Field argues it's aging brilliantly but uneasy; core technical claim is that a noncommutative/quantum variant of polynomial identity testing (PIT) admits a… | ||
| Circuit Lower Bounds (and More) via the Fusion Method | Boolean Devices 2018 | 2018-09-10 |
Fusion method reframes lower bounds as a static cover problem: pick a subset Omega of functions and lower bound circuit size by the minimum number of abstract… | ||
| Perfect Matchings | KARPfest80 | 2015-10-17 |
Avi Widgerson, Institute for Advanced Study, Princeton
KARPfest80
https://simons.berkeley.edu/karpfest/avi-wigderson-2015-10-17 | ||
| Non-commutative Computation | Neo-Classical Methods in Discrete Analysis 2013 | 2013-12-02 |
Survey of concrete results and open problems in non-commutative algebraic complexity: proves exponential formula lower bounds (Nisan-style) for some explicit… | ||
| The Gospel According to TCS | Symposium on Visions of the Theory of Computing 2013 | 2013-05-29 |
Survey of core theoretical computer science claims that maps concrete tools to outcomes: polynomial-time reductions and NP-complete gadgets explain why… | ||
| nothing matches | ||