Table 12 Empirical time complexities of OutdLastOne for 
with 
and selectivity.
with 
and selectivity.From: Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks
| Without |
|
|
|
|---|---|---|---|---|
0.1 |
|
|
|
|
0.111 |
|
|
|
|
0.125 |
|
|
|
|
0.143 |
|
|
|
|
0.167 |
|
|
|
|
0.2 |
|
|
|
|
