Computational and Proof Complexity of Partial String Avoidability (Q5061883)
From MaRDI portal
scientific article; zbMATH DE number 7489208
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational and Proof Complexity of Partial String Avoidability |
scientific article; zbMATH DE number 7489208 |
Statements
Computational and Proof Complexity of Partial String Avoidability (English)
0 references
14 March 2022
0 references
PSPACE-completeness
0 references
partial strings
0 references
avoidability
0 references
lower bound
0 references
partial words
0 references
proof complexity
0 references
