Approximation of reset thresholds with greedy algorithms (Q4976394)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation of reset thresholds with greedy algorithms |
scientific article; zbMATH DE number 6754659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of reset thresholds with greedy algorithms |
scientific article; zbMATH DE number 6754659 |
Statements
Approximation of Reset Thresholds with Greedy Algorithms (English)
0 references
28 July 2017
0 references
synchronizing automata
0 references
reset threshold
0 references
synchronizing word
0 references
approximation algorithm
0 references
inapproximability
0 references
greedy algorithm
0 references
0.8284031748771667
0 references
0.8069794178009033
0 references
0.8003423810005188
0 references
0.799084484577179
0 references
0.7889389395713806
0 references
