Y by ImSh95, Adventure10, Mango247
For definition of , see the Problems page.
One of the problems for is to find an algorithm to compute that is polynomial-time in the length of . There is already a polynomial-time algorithm for when has two distinct letters. Is there a polynomial-time algorithm for for sequences with three distinct letters?
One of the problems for is to find an algorithm to compute that is polynomial-time in the length of . There is already a polynomial-time algorithm for when has two distinct letters. Is there a polynomial-time algorithm for for sequences with three distinct letters?