The Post correspondence problem over a unary alphabet (Q1431872)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Post correspondence problem over a unary alphabet |
scientific article; zbMATH DE number 2073732
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Post correspondence problem over a unary alphabet |
scientific article; zbMATH DE number 2073732 |
Statements
The Post correspondence problem over a unary alphabet (English)
0 references
11 June 2004
0 references
Post correspondence problem
0 references
computational complexity
0 references
NP-completeness
0 references
pseudopolynomial time algorithm
0 references
0 references
