Many bounded versions of undecidable problems are NP-hard. - Andreas Klingler; Mirte van der Eyden; Sebastian Stengele; Tobias Reinhart; Gemma De las Cuevas (CoRR, 2022)