Login / Signup
Many bounded versions of undecidable problems are NP-hard.
Andreas Klingler
Mirte van der Eyden
Sebastian Stengele
Tobias Reinhart
Gemma De las Cuevas
Published in:
CoRR (2022)
Keyphrases
</>
sufficient conditions
np complete
reinforcement learning
data sets
decision trees
decreasing function
information systems
case study
three dimensional
database systems
search algorithm
continuous functions
multiple versions