Testing avoidability on sets of partial words is hard (Q1006080)
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 5529524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing avoidability on sets of partial words is hard |
scientific article; zbMATH DE number 5529524 |
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
0 references
0.9272505
0 references
0.9272505
0 references
0.8689839
0 references
0.8673305
0 references
0 references
0.8526906
0 references
0.8456769
0 references
0.8432528
0 references
