Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time (Q765479)
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: Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time |
scientific article |
Statements
Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time (English)
0 references
19 March 2012
0 references
SAT
0 references
Boolean network
0 references
singleton attractor
0 references
0 references
