Complexity of local, global and universality properties in finite dynamical systems

DOI10.1007/978-3-031-13502-6_1OpenAlexW4290017184MaRDI QIDQ2104128FDOQ2104128

Authors: Enrico Formenti 

Publication date: 9 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-13502-6_1

zbMATH Keywords

computational complexityuniversality(Finite) discrete dynamical systems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of product graphs
• Title not available (Why is that?)
• Complexity of reachability problems for finite discrete dynamical systems
• A multisecret sharing scheme for color images based on cellular automata
• Descriptive complexity: a logician's approach to computation.
• Complexity of fixed point counting problems in Boolean networks
• From additive flowers to additive automata networks
• On the complexity of occurrence and convergence problems in reaction systems
• Complexity of the dynamics of reaction systems
• Fungal automata

Cited In (3)

• Complexity for extended dynamical systems
• Global and local complexity in weakly chaotic dynamical systems
• Title not available (Why is that?)

This page was built for publication: Complexity of local, global and universality properties in finite dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104128)