Login / Signup
Polynomial formulations as a barrier for reduction-based hardness proofs.
Tatiana Belova
Alexander Golovnev
Alexander S. Kulikov
Ivan Mihajlin
Denil Sharipov
Published in:
SODA (2023)
Keyphrases
</>
theorem proving
learning theory
data mining
computational complexity
np complete
data reduction
agnostic learning
mathematical proofs
artificial intelligence
knowledge base
computer programs
reduction method
low degree