D. Gri eath and C. Moore, \Life without death is P-complete." Complex Systems 10 (1996) 437-447. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Raising Roofs, Crashing Cycles, and Playing Pool.. - Eppstein, Erickson (1999) (Correct)
....possible time bound for constructing a motorcycle graph or a single o set polygon. Atallah et al. 9] show that the construction of weighted planar partitions is P complete. A similar technique was used by Gri eath and Moore to prove the P completeness of certain twodimensional cellular automata [38]. A simple modi cation of either proof shows that construction of motorcycle graphs is also P complete, even when the motorcycles move only south, east, or southeast; see the Appendix for details. Recall that there is a simple O(n log n) time sequential algorithm for this special case. Similar ....
D. Gri eath and C. Moore. Life Without Death is P-complete. Complex Systems 10(6):437{ 447, 1997.
Raising Roofs, Crashing Cycles, and Playing Pool.. - Eppstein, Erickson (1998) (Correct)
....possible time bound for constructing a motorcycle graph or a single offset polygon. Atallah et al. 9] show that the construction of weighted planar partitions is P complete. A similar technique was used by Griffeath and Moore to prove the P completeness of certain twodimensional cellular automata [32]. A simple modification of either proof shows that construction of motorcycle graphs is also P complete, even when the motorcycles move only south, east, or south east; see the Appendix for details. Recall that there is a simple O(n log n) time sequential algorithm for this special case. Similar ....
D. Griffeath and C. Moore. Life Without Death is P-complete. Working Paper 97-05-044, Santa Fe Institute, 1997. hhttp://excite:math:wisc:edu/java/lwodpc/lwodpc:htmli. To appear in Complex Systems.
Raising Roofs, Crashing Cycles, and Playing Pool.. - Eppstein, Erickson (1998) (Correct)
....time bound for constructing a motorcycle graph or a single offset polygon. Atallah et al. 9] show that the construction of weighted planar partitions is P complete. A similar technique was used by Griffeath and Moore to prove the P completeness of certain two dimensional cellular automata [29]. A simple modification of either proof shows that construction of motorcycle graphs is also Pcomplete, even when the motorcycles move only north, east, or north east. There is a simple O(n log n) time sequential algorithm for this special case. Similar arguments show that constructing the ....
D. Griffeath and C. Moore. Life Without Death is Pcomplete. Working Paper 97-05-044, Santa Fe Institute, 1997. To appear in Complex Systems. hhttp:// psoup:math:wisc:edu/java/lwodpc/lwodpc:htmli.
Internal Diffusion-Limited Aggregation: Parallel Algorithms.. - Moore, Machta Self-citation (Moore) (Correct)
....has been shown to be P complete, for d 3 in some cases and d 2 in others. These include ordinary DLA and uid invasion [19, 21] the Ising model [21, 27] sandpiles [26] FHP and HPP lattice gases [28] cellular automata with local voting rules [27] and simple deterministic growth models [11]. Greenlaw et al. 10] have pointed out that predicting cellular automata is P complete in general, since cellular automata exist (e.g. 18] which can simulate universal Turing machines. On the other hand, NC algorithms exist for Eden growth [20] the Lorentz lattice gas [31] and cellular ....
D. Gri eath and C. Moore, \Life without death is P-complete." Complex Systems 10 (1996) 437-447.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC