Takeyuki Tamura, Tatsuya Akutsu. An O(1.787:::n:::)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes. In Erzsébet Csuhaj-Varjú, Zoltán Ésik, editors, Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings. Volume 4639 of Lecture Notes in Computer Science, pages 494-505, Springer, 2007. [doi]
@inproceedings{TamuraA07:1,
title = {An O(1.787:::n:::)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes},
author = {Takeyuki Tamura and Tatsuya Akutsu},
year = {2007},
doi = {10.1007/978-3-540-74240-1_43},
url = {http://dx.doi.org/10.1007/978-3-540-74240-1_43},
researchr = {https://researchr.org/publication/TamuraA07%3A1},
cites = {0},
citedby = {0},
pages = {494-505},
booktitle = {Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings},
editor = {Erzsébet Csuhaj-Varjú and Zoltán Ésik},
volume = {4639},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74239-5},
}