default search action
"Many bounded versions of undecidable problems are NP-hard."
Andreas Klingler et al. (2022)
- Andreas Klingler, Mirte van der Eyden, Sebastian Stengele, Tobias Reinhart, Gemma De las Cuevas:
Many bounded versions of undecidable problems are NP-hard. CoRR abs/2211.13532 (2022)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.