Automating Algebraic Proof Systems is NP-HardMarkMika Göös[0]Jakob NordströmToniann Pitassi[0]Robert Robere[0]Dmitry SokolovSusanna F. de Rezende[0]Electronic Colloquium on Computational Complexity, pp. 642020.Cited by: 0|Bibtex|Views7Other Links: academic.microsoft.comCode: Data: Full Text (Upload PDF)PPT (Upload PPT)Upload PDFUpload PPTYour rating :0 TagsCommentsSubmit
