Many bounded versions of undecidable problems are \textsf{NP}-hard
From MaRDI portal
Publication:6594491
DOI10.21468/scipostphys.14.6.173MaRDI QIDQ6594491
Andreas Klingler, Mirte van der Eyden, Tobias Reinhart, Gemma De las Cueva, Sebastian Stengele
Publication date: 28 August 2024
Published in: SciPost Physics (Search for Journal in Brave)
Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Computability and recursion theory (03Dxx)
This page was built for publication: Many bounded versions of undecidable problems are \textsf{NP}-hard