Testing avoidability on sets of partial words is hard (Q1006080): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108981141 / rank | |||
Normal rank | |||
Revision as of 20:50, 19 March 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
