toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Record Links
Author (up) Goles, E.; Montealegre-Barba, P.; Todinca, I. pdf  doi
openurl 
  Title The complexity of the bootstraping percolation and other problems Type Journal Article
  Year 2013 Publication Theoretical Computer Science Abbreviated Journal Theor. Comput. Sci.  
  Volume 504 Issue Pages 73-82  
  Keywords  
  Abstract We study the problem of predicting the state of a vertex in automata networks, where the state at each site is given by the majority function over its neighborhood. We show that for networks with maximum degree greater than 5 the problem is P-Complete, simulating a monotone Boolean circuit. Then, we show that the problem for networks with no vertex with degree greater than 4 is in NC, giving a fast parallel algorithm. Finally, we apply the result to the study of related problems. (C) 2012 Elsevier B.V. All rights reserved.  
  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 0304-3975 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000325905100008 Approved no  
  Call Number UAI @ eduardo.moreno @ Serial 320  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: