Computational Complexity of Biased Diffusion-Limited Aggregation

DOI10.1137/18M1215815MaRDI QIDQ5071091

Pedro Montealegre, Nicolas Bitar, Eric Goles Chacc

Publication date: 20 April 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.10011

zbMATH Keywords

computational complexityspace complexityP-completenessNL-completenessdiffusion-limited aggregation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Eric Goles

Cites Work

• Unnamed Item
• Unnamed Item
• On diffusion limited deposition
• The complexity of the bootstraping percolation and other problems
• Planar and grid graph reachability problems
• Growth and roughness of the interface for ballistic deposition
• The computational complexity of sandpiles
• Internal diffusion-limited aggregation: parallel algorithms and complexity
• The parallel complexity of growth models
• The computational complexity of generating random fractals
• On ballistic deposition process on a strip
• Iterated conformal dynamics and Laplacian growth
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• Computational Complexity

This page was built for publication: Computational Complexity of Biased Diffusion-Limited Aggregation