| Home | << 1 >> |
|
| Record | |||||
|---|---|---|---|---|---|
| Author | Goles, E.; Montealegre, P. | ||||
| Title | Computational complexity of threshold automata networks under different updating schemes | Type | |||
| Year | 2014 | Publication  |
Theoretical Computer Science | Abbreviated Journal | Theor. Comput. Sci. |
| Volume | 559 | Issue | Pages | 3-19 | |
| Keywords | Automata networks; Threshold functions; Computational complexity; Updating scheme; P-completeness; NC; NP-Hard | ||||
| Abstract | Given a threshold automata network, as well as an updating scheme over its vertices, we study the computational complexity associated with the prediction of the future state of a vertex. More precisely, we analyze two classes of local functions: the majority and the AND-OR rule (vertices take the AND or the OR logic functions over the state of its neighborhoods). Depending on the updating scheme, we determine the complexity class (NC, P, NP, PSPACE) where the prediction problem belongs. (C) 2014 Elsevier B.V. All rights reserved. | ||||
| Address | [Goles, Eric] Univ Adolfo Ibanez, Fac Ciencias & Tecnol, Santiago, Chile, Email: eric.chacc@uai.cl; | ||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier Science Bv | Place of Publication | Editor | ||
| Language | English | Summary Language | Original Title | ||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0304-3975 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | WOS:000347025300002 | Approved | |||
| Call Number | UAI @ eduardo.moreno @ | Serial | 434 | ||
| Permanent link to this record | |||||