Pages that link to "Item:Q2920454"
From MaRDI portal
The following pages link to On the Kernelization Complexity of String Problems (Q2920454):
Displaying 9 items.
- \(k\) one-way heads cannot do string-matching (Q676454) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- The complexity of string partitioning (Q2343298) (← links)
- The Complexity of String Partitioning (Q2904489) (← links)
- Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity (Q2921012) (← links)
- (Q4608614) (← links)
- Consensus strings with small maximum distance and small distance sum (Q5005095) (← links)
- On Hardness of Several String Indexing Problems (Q5165610) (← links)