Parameterized String Equations

04/29/2021
by   Laurent Bulteau, et al.
0

We study systems of String Equations where block variables need to be assigned strings so that their concatenation gives a specified target string. We investigate this problem under a multivariate complexity framework, searching for tractable special cases such as systems of equations with few block variables or few equations. Our main results include a polynomial-time algorithm for size-2 equations, and hardness for size-3 equations, as well as hardness for systems of two equations, even with tight constraints on the block variables. We also study a variant where few deletions are allowed in the target string, and give XP algorithms in this setting when the number of block variables is constant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2018

Block Palindromes: A New Generalization of Palindromes

We propose a new generalization of palindromes and gapped palindromes ca...
research
06/29/2018

Supercompiling String Programs Using Word Equations as Constraints

We describe a general parameterized scheme of program and constraint ana...
research
09/18/2023

Graph Threading

Inspired by artistic practices such as beadwork and himmeli, we study th...
research
05/18/2020

On the Separability Problem of String Constraints

We address the separability problem for straight-line string constraints...
research
05/26/2023

Can You Solve Closest String Faster than Exhaustive Search?

We study the fundamental problem of finding the best string to represent...
research
09/05/2019

Computational Complexity of k-Block Conjugacy

We consider several computational problems related to conjugacy between ...
research
09/12/2013

On SAT representations of XOR constraints

We study the representation of systems S of linear equations over the tw...

Please sign up or login with your details

Forgot password? Click here to reset