![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
"On the Complexity of Inference and Completion of Boolean Networks from ..."
Hao Jiang et al. (2013)
- Hao Jiang, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu
:
On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(11): 2265-2274 (2013)
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.