The computational complexity of pattern formation

DOI10.1007/BF01053602zbMath0935.82566OpenAlexW1977503354MaRDI QIDQ1279214

Jonathan Machta

Publication date: 22 May 2000

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01053602

zbMATH Keywords

computational complexitypattern formationparallel computersDLA\(P\)-completenessfluid invasion

Mathematics Subject Classification ID

Flows in porous media; filtration; seepage (76S05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

The parallel complexity of growth models, The computational complexity of generating random fractals, Freezing sandpiles and Boolean threshold networks: equivalence and complexity, Parallel dynamics and computational complexity of the Bak-Sneppen model, CHOOSEY HOT SAND: REFLECTION OF GRAIN SENSITIVITY ON PATTERN MORPHOLOGY, Natural complexity, computational complexity and depth

Cites Work

• Parallelism and the maximal path problem
• Average case completeness
• A taxonomy of problems with fast parallel algorithms
• Average Case Complete Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item