Pages that link to "Item:Q1944896"
From MaRDI portal
The following pages link to The NP-completeness of the road coloring problem (Q1944896):
Displayed 5 items.
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- A complete solution to the complexity of synchronizing road coloring for non-binary alphabets (Q2346422) (← links)
- A quadratic algorithm for road coloring (Q2449052) (← links)