Search
Home
Activities
Staff
Prizes
Research units
Research output
Projects
Press/Media
About
Approximation of Reset Thresholds with Greedy Algorithms
Research output
:
Contribution to journal
›
Article
›
peer-review
Department of Algebra and Fundamental Informatics
Laboratory of Combinatorial Algebra
Institute of Mathematics and Computer Science
Institute of Natural Sciences and Mathematics
Overview
Cite this
DOI
https://doi.org/10.3233/FI-2016-1357
Final published version
Dimitry S. Ananichev
Vladimir V. Gusev
Original language
English
Pages (from-to)
221-227
Number of pages
7
Journal
Fundamenta Informaticae
Volume
145
Issue number
3
DOIs
https://doi.org/10.3233/FI-2016-1357
Publication status
Published -
2016
WoS ResearchAreas Categories
Computer Science, Software Engineering
Mathematics, Applied
Research areas
approximation algorithm, greedy algorithm, inapproximability, reset threshold, Synchronizing automata, synchronizing word
ASJC Scopus subject areas
Theoretical Computer Science
Algebra and Number Theory
Information Systems
Computational Theory and Mathematics
ID: 1097414
