The computational complexity of the Lorentz lattice gas

DOI10.1007/BF02181282zbMath0945.82500arXivcomp-gas/9607001MaRDI QIDQ1284985

K. Appert

Publication date: 27 September 2000

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

Full work available at URL: https://arxiv.org/abs/comp-gas/9607001

zbMATH Keywords

computational complexityparallel computationLorentz lattice gaslogical depth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (1)

Natural complexity, computational complexity and depth

Cites Work

• Diffusion in Lorentz lattice gas automata with backscattering
• The parallel complexity of growth models
• The computational complexity of generating random fractals
• Circuit Definitions of Nondeterministic Complexity Classes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The computational complexity of the Lorentz lattice gas