ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS (Q5493901): Difference between revisions
From MaRDI portal
Latest revision as of 20:47, 24 June 2024
scientific article; zbMATH DE number 5064541
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS |
scientific article; zbMATH DE number 5064541 |
Statements
ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS (English)
0 references
16 October 2006
0 references
discrete dynamical systems
0 references
cellular and graph automata
0 references
computational complexity
0 references
enumeration problems
0 references
{\#}P-completeness
0 references
0 references
