On the Kernelization Complexity of String Problems

DOI10.1007/978-3-319-08783-2_13zbMATH Open1423.68200OpenAlexW4249701285MaRDI QIDQ2920454FDOQ2920454

Saket Saurabh, Ashutosh Rai, M. S. Ramanujan, Manu Basavaraju, Fahad Panolan

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_13

zbMATH Keywords

parameterized complexitykernelizationclosest stringcross-composition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Cited In (9)

• On Hardness of Several String Indexing Problems
• \(k\) one-way heads cannot do string-matching
• Title not available (Why is that?)
• The complexity of string partitioning
• Title not available (Why is that?)
• The Complexity of String Partitioning
• Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
• On the complexity of learning strings and sequences
• The invariant problem for binary string structures and the parallel complexity theory of queries

This page was built for publication: On the Kernelization Complexity of String Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920454)