toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Author Goles, E.; Montealegre, P. pdf  doi
openurl 
  Title The complexity of the majority rule on planar graphs Type
  Year 2015 Publication Advances In Applied Mathematics Abbreviated Journal Adv. Appl. Math.  
  Volume 64 Issue Pages 111-123  
  Keywords Automata networks; Computational complexity; Majority; P-Completeness; NC; Planar graph  
  Abstract We study the complexity of the majority rule on planar automata networks. We reduce a special case of the Monotone Circuit Value Problem to the prediction problem of determining if a vertex of a planar graph will change its state when the network is updated with the majority rule. (C) 2014 Elsevier Inc. All rights reserved.  
  Address [Goles, Eric] Univ Adolfo Ibanez, Fac Ciencias & Tecnol, Santiago, Chile, Email: eric.chacc@uai.cl;  
  Corporate Author Thesis  
  Publisher Academic Press Inc Elsevier Science Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0196-8858 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000348883400007 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 445  
Permanent link to this record
 

 
Author Goles, E.; Montealegre, P. doi  openurl
  Title The complexity of the asynchronous prediction of the majority automata Type
  Year 2020 Publication Information and Computation Abbreviated Journal Inf. Comput.  
  Volume 274 Issue SI Pages  
  Keywords Majority automata; Cellular automata; Prediction problem; Asynchronous updating; Computational complexity; Parallel algorithms; Bootstrap percolation; NP-Completeness  
  Abstract We consider the asynchronous prediction problem for some automaton as the one consisting in determining, given an initial configuration, if there exists a non-zero probability that some selected site changes its state, when the network is updated picking one site at a time uniformly at random. We show that for the majority automaton, the asynchronous prediction problem is in NC in the two-dimensional lattice with von Neumann neighborhood. Later, we show that in three or more dimensions the problem is NP-Complete.  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0890-5401 ISBN Medium  
  Area Expedition Conference  
  Notes Approved  
  Call Number UAI @ eduardo.moreno @ Serial 1124  
Permanent link to this record
 

 
Author Goles, E.; Montealegre, P.; Perrot, K.; Theyssier, G. pdf  doi
openurl 
  Title On the complexity of two-dimensional signed majority cellular automata Type
  Year 2018 Publication Journal Of Computer And System Sciences Abbreviated Journal J. Comput. Syst. Sci.  
  Volume 91 Issue Pages 1-32  
  Keywords Cellular automata dynamics; Majority cellular automata; Signed two-dimensional lattice; Turing universal; Intrinsic universal; Computational complexity  
  Abstract We study the complexity of signed majority cellular automata on the planar grid. We show that, depending on their symmetry and uniformity, they can simulate different types of logical circuitry under different modes. We use this to establish new bounds on their overall complexity, concretely: the uniform asymmetric and the non-uniform symmetric rules are Turing universal and have a P-complete prediction problem; the non-uniform asymmetric rule is intrinsically universal; no symmetric rule can be intrinsically universal. We also show that the uniform asymmetric rules exhibit cycles of super-polynomial length, whereas symmetric ones are known to have bounded cycle length. (C) 2017 Elsevier Inc. All rights reserved.  
  Address [Goles, Eric; Montealegre, Pedro] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Santiago, Chile, Email: p.montealegre@uai.cl  
  Corporate Author Thesis  
  Publisher Academic Press Inc Elsevier Science Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0022-0000 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000413130200001 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 779  
Permanent link to this record
 

 
Author Goles, E.; Montealegre, P.; Salo, V.; Torma, I. pdf  doi
openurl 
  Title PSPACE-completeness of majority automata networks Type
  Year 2016 Publication Theoretical Computer Science Abbreviated Journal Theor. Comput. Sci.  
  Volume 609 Issue Pages 118-128  
  Keywords Boolean network; Majority network; Prediction problem; PSPACE  
  Abstract We 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. (C) 2015 Elsevier B.V. All rights reserved.  
  Address [Goles, Eric] Univ Adolfo Ibanez, Fac Ingn & Ciencias, 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:000367488400009 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 572  
Permanent link to this record
 

 
Author Goles, E.; Montealegre, P.; Vera, J. url  openurl
  Title Naming Game Automata Networks Type
  Year 2016 Publication Journal Of Cellular Automata Abbreviated Journal J. Cell. Autom.  
  Volume 11 Issue 5-6 Pages 497-521  
  Keywords Automata networks; cellular automata; majority functions; energy operator; naming game; fixed points; limit cycles  
  Abstract In this paper we introduce automata networks to model some features of the emergence of a vocabulary related with the naming game model. We study the dynamical behaviour (attractors and convergence) of extremal and majority local functions.  
  Address [Goles, Eric; Vera, Javier] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Avda Diagonal Las Torres 2640, Santiago, Chile, Email: eric.chacc@uai.cl;  
  Corporate Author Thesis  
  Publisher Old City Publishing Inc Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 1557-5969 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000382426500007 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 649  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: