The time is now - Spring classes are filling up!

MIT PRIMES/Art of Problem Solving

CROWDMATH 2019: Graph Coloring

G
Topic
First Poster
Last Poster
formation width algorithm for 3-letter sequences
JGeneson   2
N Dec 9, 2019 by JGeneson
For definition of $fw(u)$, see the Problems page.

One of the problems for $fw(u)$ is to find an algorithm to compute $fw(u)$ that is polynomial-time in the length of $u$. There is already a polynomial-time algorithm for $fw(u)$ when $u$ has two distinct letters. Is there a polynomial-time algorithm for $fw(u)$ for sequences $u$ with three distinct letters?
2 replies
JGeneson
Nov 19, 2019
JGeneson
Dec 9, 2019
No more topics!
a