"Department of Computer Science, University of Liverpool, UK" .
"nondeterministic polynomial time" .
"Wojciech" .
_:N78947597d3bc4c4790c7ef1aa3bfe18a .
_:N705145b7494945b5b05de66e0eec9949 .
_:Nd468c5724833488eb91889e07487e824 .
"2022-08-04T17:21" .
.
"words" .
.
_:Nd468c5724833488eb91889e07487e824 _:Nb3cca9b57f104b1aad6529525547e2ba .
"Department of Computer Science, University of Liverpool, UK" .
"https://doi.org/10.1007/bfb0055097" .
_:N5830ff450d474b1b897fb6ef3e7276ca .
"Application of Lempel-Ziv encodings to the solution of word equations" .
"problem" .
"Pure Mathematics" .
_:N3fac7c375b844dddb8051bc84c2457a1 "doi" .
"variables" .
"properties" .
.
"731-742" .
"deterministic time" .
.
"general version" .
"results" .
_:Ne4f4afea55d3420e8705fb6f69ed5938 _:N78947597d3bc4c4790c7ef1aa3bfe18a .
"complexity" .
"function" .
"encoding" .
_:Nb3cca9b57f104b1aad6529525547e2ba "Winskel" .
_:N80ef3ba784924468b579bf877ab5b339 "Automata, Languages and Programming" .
"string" .
_:N5c42abcc0bed44009f926c30ed4d200b "pub.1026190890" .
.
"Makanin's algorithm" .
_:N3ba8fc8d36ac42f78ab31be498702c7b _:Nd468c5724833488eb91889e07487e824 .
"length of variables" .
"false"^^ .
.
"applications" .
"relation" .
"1998" .
.
"Lempel-Ziv compression" .
_:N3fac7c375b844dddb8051bc84c2457a1 .
_:Ne4f4afea55d3420e8705fb6f69ed5938 .
"word equations" .
_:N3ba8fc8d36ac42f78ab31be498702c7b _:N5830ff450d474b1b897fb6ef3e7276ca .
_:N266a42ee8b9240d8a8059ad95fdc02b8 .
_:N5c42abcc0bed44009f926c30ed4d200b "dimensions_id" .
_:Nb3cca9b57f104b1aad6529525547e2ba "Glynn" .
"Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland" .
_:N5c42abcc0bed44009f926c30ed4d200b .
"Turku Centre for Computer Science and Department of Mathematics, Turku University, 20 014, Turku, Finland" .
"Mathematical Sciences" .
"time" .
_:N56d84771666b499dac7fe57c7d562637 "Larsen" .
_:N80ef3ba784924468b579bf877ab5b339 "978-3-540-68681-1" .
_:N56d84771666b499dac7fe57c7d562637 .
.
"simple algorithm" .
_:N5830ff450d474b1b897fb6ef3e7276ca "Sven" .
"Plandowski" .
"1998-01-01" .
_:N3fac7c375b844dddb8051bc84c2457a1 .
"length" .
_:N266a42ee8b9240d8a8059ad95fdc02b8 "Springer Nature" .
"solvability" .
"version" .
"first main result" .
"paper" .
"compression" .
"exponential function" .
.
.
_:Nb3cca9b57f104b1aad6529525547e2ba .
.
"new approach" .
"polynomial size" .
_:N705145b7494945b5b05de66e0eec9949 _:N56d84771666b499dac7fe57c7d562637 .
"algorithm" .
.
"chapters" .
_:N5c42abcc0bed44009f926c30ed4d200b .
"main results" .
.
"chapter" .
"Turku Centre for Computer Science and Department of Mathematics, Turku University, 20 014, Turku, Finland" .
_:N56d84771666b499dac7fe57c7d562637 "Kim G." .
"solution" .
_:N5830ff450d474b1b897fb6ef3e7276ca "Skyum" .
_:N59e39217579c41639a2e32753f4f8e78 .
_:N705145b7494945b5b05de66e0eec9949 _:N3ba8fc8d36ac42f78ab31be498702c7b .
"long solutions" .
"binaries" .
_:N59e39217579c41639a2e32753f4f8e78 "Springer Nature - SN SciGraph project" .
_:N78947597d3bc4c4790c7ef1aa3bfe18a .
_:N80ef3ba784924468b579bf877ab5b339 .
"size" .
"intricate algorithms" .
"first solution" .
_:N59e39217579c41639a2e32753f4f8e78 .
"Wojciech" .
"equations" .
"approach" .
.
_:N266a42ee8b9240d8a8059ad95fdc02b8 .
_:N80ef3ba784924468b579bf877ab5b339 .
.
"LZ" .
.
"terms" .
_:N3fac7c375b844dddb8051bc84c2457a1 "10.1007/bfb0055097" .
.
"One of the most intricate algorithms related to words is Makanin's algorithm solving word equations. The algorithm is very complicated and the complexity of the problem of solving word equations is not well understood. Word equations can be used to define various properties of strings, e.g. general versions of pattern-matching with variables. This paper is devoted to introduce a new approach and to study relations between Lempel-Ziv compressions and word equations. Instead of dealing with very long solutions we propose to deal with their Lempel-Ziv encodings. As our first main result we prove that each minimal solution of a word equation is highly compressible (exponentially compressible for long solutions) in terms of Lempel-Ziv encoding. A simple algorithm for solving word equations is derived. If the length of minimal solution is bounded by a singly exponential function (which is believed to be always true) then LZ encoding of each minimal solution is of a polynomial size (though the solution can be exponentially long) and solvability can be checked in nondeterministic polynomial time. As our second main result we prove that the solvability can be tested in polynomial deterministic time if the lengths of all variables are given in binary. We show also that lexicographically first solution for given lengths of variables is highly compressible in terms of Lempel-Ziv encodings." .
_:N80ef3ba784924468b579bf877ab5b339 "978-3-540-64781-2" .
"https://scigraph.springernature.com/explorer/license/" .
"second main result" .
_:Ne4f4afea55d3420e8705fb6f69ed5938 .
"minimal solutions" .
.
"Rytter" .
"polynomial time" .
"properties of strings" .