Computational complexity of threshold automata networks under different updating schemes
- Submitting institution
-
University of the West of England, Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 5608313
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2014.09.010
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 3
- Volume
- 559
- Issue
- -
- ISSN
- 0304-3975
- Open access status
- Out of scope for open access requirements
- Month of publication
- September
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Originality: (1) Pioneering results on complexity of predicting future states of vertices in threshold automata networks. (2) A complexity class where the prediction belongs is determined.
Rigour: Results are supported by finite state machines techniques and mathematical proofs.
Significance: Authors were subsequently invited to give keynote talks at Automata 2019, SIROCCO 2019 and 13th LATIN 2018 conferences.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
