Login / Signup
Automating Algebraic Proof Systems is NP-Hard.
Mika Göös
Jakob Nordström
Toniann Pitassi
Robert Robere
Dmitry Sokolov
Susanna F. de Rezende
Published in:
Electron. Colloquium Comput. Complex. (2020)
Keyphrases
</>
np hard
search algorithm
data sets
computing systems
computer systems
distributed systems
management system
special case
case study
machine learning
real time
computational complexity
lower bound
optimal solution
bayesian networks
scheduling problem
web services
linear programming
minimum cost