# Search results

Theoretical Computer Science > 2015 > 583 > Complete > 1-26

^{n}to itself. We define the subnetworks of f as the restrictions of f to the subcubes of {0,1}

^{n}, and we characterize a class F of Boolean networks satisfying the following property: Every subnetwork of f has a unique fixed point if and only if f has no subnetwork in F. This characterization generalizes...

Mathematical Methods in the Applied Sciences > 46 > 5 > 5521 - 5544

Asian Journal of Control > 25 > 1 > 623 - 628

Mathematical Methods in the Applied Sciences > 46 > 2 > 1821 - 1836

Mathematical Methods in the Applied Sciences > 45 > 17 > 10775 - 10797

Mathematical Methods in the Applied Sciences > 45 > 16 > 9998 - 10009

Numerical Methods for Partial Differential Equations > 38 > 4 > 794 - 802

Mathematical Methods in the Applied Sciences > 45 > 9 > 5111 - 5134

Mathematical Methods in the Applied Sciences > 45 > 7 > 3417 - 3425

Mathematical Methods in the Applied Sciences > 45 > 3 > 1587 - 1596

Mathematische Nachrichten > 294 > 11 > 2184 - 2187

Demonstratio Mathematica > 2021 > Vol. 54, nr 1 > 452--461

Mathematical Methods in the Applied Sciences > 44 > 17 > 13526 - 13539

Mathematical Methods in the Applied Sciences > 44 > 17 > 12760 - 12773

Mathematical Methods in the Applied Sciences > 44 > 10 > 8345 - 8362

Mathematical Methods in the Applied Sciences > 44 > 9 > 7416 - 7422

Fasciculi Mathematici > 2021 > nr 65 > 5--15

Demonstratio Mathematica > 2020 > Vol. 53, nr 1 > 309--324