Matching sequences of two digits in matrices is hard
Matsakis, Nicolaos
Original · EN
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete
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.