Polynomial formulations as a barrier for reduction-based hardness proofs.

Alexander S. Kulikov Ivan Mihajlin

Published in: CoRR (2022)

Keyphrases

theorem proving
np hard
optimization methods
real time
information retrieval
learning algorithm
computational complexity
theorem prover
equational theories
agnostic learning
learning theory
worst case
upper bound
search space
website
knowledge base
neural network