Pages that link to "Item:Q1749539"
From MaRDI portal
The following pages link to On the kernelization complexity of string problems (Q1749539):
Displaying 11 items.
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- \(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)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- The complexity of string partitioning (Q2343298) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- The Complexity of String Partitioning (Q2904489) (← links)
- (Q4608614) (← links)
- On Hardness of Several String Indexing Problems (Q5165610) (← links)
- Offensive alliances in graphs (Q6201327) (← links)