The following pages link to (Q4608614):
Displaying 9 items.
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- A complete mechanization of correctness of a string-preprocessing algorithm (Q816208) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Completeness of string analysis for dynamic languages (Q2051812) (← links)
- (Q3114378) (← links)
- Computational and Proof Complexity of Partial String Avoidability (Q5061883) (← links)
- Variant Satisfiability of Parameterized Strings (Q6486037) (← links)
