Most important new papers in computational complexity We often hear about classic research and publications in the field of computational complexity (Turing, Cook, Karp, Hartmanis, Razborov etc). I was wondering if there are recently published papers considered seminal and a must read. By recent I mean in the last 5/10 years.
The recent paper of László Babai showing that Graph Isomorphism is in Quasi-P is already a classic.

Here is a more accessible exposition of the result published in the ICM 2018 proceedings.