\#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
type: Item
instance of: scholarly article
title: \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
DOI: 10.1007/978-3-030-51466-2_30
author: Kévin Perrot
author: Sylvain Sené
author: Lucas Venturini
publication date: 2022-12-16T00:00:00Z
full work available at URL: https://arxiv.org/abs/2004.02129
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7633521
MaRDI profile type: Publication
OpenAlex ID: W3037440941
cites work: On the number of different dynamics in Boolean networks with deterministic update schedules
cites work: On the number of update digraphs and its relation with the feedback arc sets and tournaments
cites work: Combinatorics on update digraphs in Boolean networks
cites work: Limit cycles and update digraphs in Boolean networks
cites work: Tutte polynomials for directed graphs
cites work: Parallel algorithms for series parallel graphs
cites work: A Decomposition for Combinatorial Geometries
cites work: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
cites work: Abelian sandpile model and Biggs-Merino polynomial for directed graphs
cites work: Topology of series-parallel networks
cites work: Guided tour of asynchronous cellular automata
cites work: Q5551177
cites work: Q4023519
cites work: Hard Enumeration Problems in Geometry and Combinatorics
cites work: A logical calculus of the ideas immanent in nervous activity
cites work: Synchronism versus asynchronism in monotonic Boolean automata networks
cites work: Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations
cites work: Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
cites work: Blocs-H-matrices et convergence des méthodes itératives classiques par blocs
cites work: Graph minors. XX: Wagner's conjecture
description: scientific article; zbMATH DE number 7633521