bounded Post correspondence problem
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:definedIn |
gptkb:Post_correspondence_problem_with_a_bound_on_the_number_of_tiles_used
|
| gptkbp:field |
gptkb:complexity_theory
computability theory theoretical computer science |
| gptkbp:hasProperty |
NP-complete
decidable |
| https://www.w3.org/2000/01/rdf-schema#label |
bounded Post correspondence problem
|
| gptkbp:introduced |
gptkb:Emil_Post
|
| gptkbp:relatedTo |
gptkb:Post_correspondence_problem
|
| gptkbp:solvedBy |
nondeterministic polynomial time algorithm
|
| gptkbp:bfsParent |
gptkb:Post_correspondence_problem
|
| gptkbp:bfsLayer |
6
|