Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems
From MaRDI portal
Publication:2947406
DOI10.1007/978-3-319-22360-5_3zbMath1465.68128OpenAlexW1172283734MaRDI QIDQ2947406
S. S. Ravi, Richard E. Stearns, Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, Daniel J. Rosenkrantz
Publication date: 23 September 2015
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_3
Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Dynamical systems involving maps of trees and graphs (37E25)
Related Items (1)
Cites Work
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
- A Random NP-complete problem for inversion of 2D cellular automata
- Complexity of reachability problems for finite discrete dynamical systems
- Dichotomy results for fixed point counting in Boolean dynamical systems
- Predecessor existence problems for finite discrete dynamical systems
- Computational classification of cellular automata
- Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems
- Recovering Social Networks from Contagion Information
- Rumors in a Network: Who's the Culprit?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems
