Approximating the minimum length of synchronizing words is hard
Berlinkov, M. V.
Original · EN
We prove that, unless P=NP, no polynomial algorithm can approximate the minimum length of for a given within a constant factor.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.