A survey on PIT for read-once algebraic branching programs @SimonsInstitute
A survey on PIT for read-once algebraic branching programs  @SimonsInstitute
Uploaded October 2026 | Updated November 2026, 3 days ago
Michael Forbes (University of Illinois at Urbana-Champaign)
https://simons.berkeley.edu/talks/michael-forbes-university-illinois-urbana-champaign-2026-10-28
Derandomization
A survey on PIT for read-once algebraic branching programsNew directions in catalytic derandomizationPolar Codes IFourier quasicrystals from stable polynomials and beyondAlgebraic Geometry and Discrete Periodic OperatorsFinite free information inequalitiesCompressed timestamps and efficient random walks in catalytic spaceRandom unitary circuits with constant spectral gapFrom local discrete curvature notions of graphs to global properties of the underlying spacesProperty (T), sums of square and numerical certificatesA Simple Sub-Polynomial Degree Coboundary ExpanderBipartite matching is in NC
Simons Institute for the Theory of Computing |

A survey on PIT for read-once algebraic branching programs

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER