The following pages link to Adam Roman (Q1008632):
Displaying 13 items.
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- The NP-completeness of the road coloring problem (Q1944896) (← links)
- CORES: fusion of supervised and unsupervised training methods for a multi-class classification problem (Q2281972) (← links)
- Complexity of road coloring with prescribed reset words (Q2424693) (← links)
- THEORETICAL FOUNDATIONS AND EXPERIMENTAL RESULTS FOR A HIERARCHICAL CLASSIFIER WITH OVERLAPPING CLUSTERS (Q2857293) (← links)
- P–NP Threshold for Synchronizing Road Coloring (Q2890221) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- Experiments on Synchronizing Automata (Q3113296) (← links)
- Decision Version of the Road Coloring Problem Is NP-Complete (Q3183619) (← links)
- Genetic Algorithm for Synchronization (Q3618622) (← links)
- (Q5192683) (← links)
- (Q5249241) (← links)
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata (Q5448671) (← links)
