Show simple item record

Authordc.contributor.authorGoles Chacc, Eric, 1951- 
Authordc.contributor.authorMontealegre, Pedro 
Authordc.contributor.authorSalo, Ville 
Authordc.contributor.authorTörmä, Ilkka 
Admission datedc.date.accessioned2016-01-28T14:32:19Z
Available datedc.date.available2016-01-28T14:32:19Z
Publication datedc.date.issued2016
Cita de ítemdc.identifier.citationTheoretical Computer Science Volumen: 609 Páginas: 118-128 Subdivisión: 1 Jan 2016en_US
Identifierdc.identifier.otherDOI: 10.1016/j.tcs.2015.09.014
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/136835
General notedc.descriptionArtículo de publicación ISIen_US
Abstractdc.description.abstractWe study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the problem of predicting an eventual state change in some vertex, given an initial configuration, is PSPACE-complete.en_US
Patrocinadordc.description.sponsorshipCONICYT-Becas Chile 72130083 FONDECYT 1140090 ECOS C12E05 Basal project PFB-03 Centro de Modelamiento Matematico CNRS UMI 2807 Universidad de Chile Academy of Finland 131558en_US
Lenguagedc.language.isoenen_US
Publisherdc.publisherElsevieren_US
Type of licensedc.rightsAtribución-NoComercial-SinDerivadas 3.0 Chile*
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/*
Keywordsdc.subjectBoolean networken_US
Keywordsdc.subjectMajority networken_US
Keywordsdc.subjectPrediction problemen_US
Keywordsdc.subjectPSPACEen_US
Títulodc.titlePSPACE-completeness of majority automata networksen_US
Document typedc.typeArtículo de revista


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial-SinDerivadas 3.0 Chile
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 Chile