Open AccessOn computational complexity of successor theory with unary transitive closure
Author(s) -
Сергей Михайлович Дудаков
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1202/1/012018
Subject(s) - unary operation , successor cardinal , transitive closure , closure operator , closure (psychology) , transitive relation , mathematics , operator (biology) , discrete mathematics , computational complexity theory , order (exchange) , function (biology) , algorithm , combinatorics , mathematical analysis , closed set , biochemistry , chemistry , finance , repressor , economics , transcription factor , market economy , gene , evolutionary biology , biology