Many bounded versions of undecidable problems are \textsf{NP}-hard (Q6594491)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7902871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Many bounded versions of undecidable problems are \textsf{NP}-hard |
scientific article; zbMATH DE number 7902871 |
Statements
Many bounded versions of undecidable problems are \textsf{NP}-hard (English)
0 references
28 August 2024
0 references
