Deterministic Quasipolynomial-Time Black-Box Algorithm for Noncommutative Rational Identity Testing

We construct a deterministic quasipolynomial-size hitting set for noncommutative rational formulas, solving the long-standing open problem of designing an efficient deterministic black-box algorithm for rational identity testing.