The NP-completeness of the road coloring problem
type: Item
instance of: scholarly article
title: The NP-completeness of the road coloring problem
zbMATH Open document ID: 1260.68162
author: Adam Roman
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6149183
zbMATH Keywords: computational complexity
zbMATH Keywords: synchronization
zbMATH Keywords: road coloring problem
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.12.016
OpenAlex ID: W2012090802
cites work: Similarity of automorphisms of the torus
cites work: Equivalence of topological Markov shifts
cites work: Reset Sequences for Monotonic Automata
cites work: The Complexity of Finding Reset Words in Finite Automata
cites work: Decision Version of the Road Coloring Problem Is NP-Complete
cites work: An Algorithm for Road Coloring
cites work: The road coloring problem
DOI: 10.1016/J.IPL.2010.12.016
description: scientific article; zbMATH DE number 6149183