Testing avoidability on sets of partial words is hard (Q1006080): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:54, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing avoidability on sets of partial words is hard |
scientific article |
Statements
Testing avoidability on sets of partial words is hard (English)
0 references
17 March 2009
0 references
combinatorics on words
0 references
partial words
0 references
unavoidable sets
0 references
3SAT problem
0 references
NP-hard problems
0 references
