Pravesh Kothari, Ruta Mehta. Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium. Electronic Colloquium on Computational Complexity (ECCC), 25:126, 2018. [doi]
@article{KothariM18-0,
title = {Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium},
author = {Pravesh Kothari and Ruta Mehta},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/126},
researchr = {https://researchr.org/publication/KothariM18-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {25},
pages = {126},
}