Automating Algebraic Proof Systems is NP-Hard

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.