Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov 0001, Susanna F. de Rezende. Automating Algebraic Proof Systems is NP-Hard. Electronic Colloquium on Computational Complexity (ECCC), 27:64, 2020. [doi]
@article{GoosNPRSR20,
title = {Automating Algebraic Proof Systems is NP-Hard},
author = {Mika Göös and Jakob Nordström and Toniann Pitassi and Robert Robere and Dmitry Sokolov 0001 and Susanna F. de Rezende},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/064},
researchr = {https://researchr.org/publication/GoosNPRSR20},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {27},
pages = {64},
}