Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov 0001. Automating algebraic proof systems is NP-hard. In Samir Khuller, Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. pages 209-222, ACM, 2021. [doi]
@inproceedings{RezendeGNPR021,
title = {Automating algebraic proof systems is NP-hard},
author = {Susanna F. de Rezende and Mika Göös and Jakob Nordström and Toniann Pitassi and Robert Robere and Dmitry Sokolov 0001},
year = {2021},
doi = {10.1145/3406325.3451080},
url = {https://doi.org/10.1145/3406325.3451080},
researchr = {https://researchr.org/publication/RezendeGNPR021},
cites = {0},
citedby = {0},
pages = {209-222},
booktitle = {STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021},
editor = {Samir Khuller and Virginia Vassilevska Williams},
publisher = {ACM},
isbn = {978-1-4503-8053-9},
}