Cargando…
#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
Automata networks are a very general model of interacting entities, with applications to biological phenomena such as gene regulation. In many contexts, the order in which entities update their state is unknown, and the dynamics may be very sensitive to changes in this schedule of updates. Since the...
Autores principales: | Noûs, Camille, Perrot, Kévin, Sené, Sylvain, Venturini, Lucas |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7309494/ http://dx.doi.org/10.1007/978-3-030-51466-2_30 |
Ejemplares similares
-
Correction to: #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
por: Perrot, Kévin, et al.
Publicado: (2021) -
Digraphs
por: Bang-Jensen, Jorgen, et al.
Publicado: (2009) -
Graphs and digraphs
por: Chartrand, Gary
Publicado: (1986) -
Graphs and digraphs
por: Chartrand, Gary, et al.
Publicado: (2015) -
Threshold Digraphs
por: Cloteaux, Brian, et al.
Publicado: (2014)