"Many bounded versions of undecidable problems are NP-hard."

Andreas Klingler et al. (2022)

Details and statistics

DOI: 10.48550/ARXIV.2211.13532

access: open

type: Informal or Other Publication

metadata version: 2022-11-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics