The computational complexity of the lorentz lattice gas

Journal of Statistical Physics

Volumn 87, Issue 5-6, 1997, Pages 1245-1252

  Machta, J ^a   Moriarty, K ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

Computational complexity; Logical depth; Lorentz lattice gas; Parallel com; Putation

Indexed keywords

EID: 0031160986     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02181282     Document Type: Article

References (15)

1. M. H. Ernst and G. A. van Velzen, Lattice Lurentz gas, J. Phys. A: Math. Gen. 22:4611 (1989).
2. M. H. Ernst and G. A. van Velzen, Long-time tails in lattice Lorentz gases, J. Stat. Phys. 57:455 (1989).
3. H. van Beijeren and M. H. Ernst, Diffusion in Lurentz lattice gas automata with backscattering, J. Stat. Phys. 70:793 (1993).
4. M. H. Ernst, J. R. Dorfman, and D. Jacobs, Mean-field theory for Lyapunov exponents and Kolmogorov Sinai entropy in Lorentz lattice gases, Phys. Rev. Lett. 74:4416 (1995).
5. E. G. D. Cohen and F. Wang, Novel phenomena in Lorentz lattice gases, Physica A 219:56 (1995).
6. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, Massachusetts, 1979).
7. H. R. Lewis and C. H. Papadimitriou, Elements of the Theory of Computation (Prentice-Hall, Englewood Cliffs, New Jersey, 1981).
8. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory (Oxford University Press, Oxford, 1995).
9. D. S. Johnson, A catalog of complexity classes, in Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, J. van Leeuwan, ed. (M.I.T. Press/Elsevier, 1990), p. 68.
10. M. R. Garey and D. S. Johnson, Computers und Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
11. A. Gibbons and W. Rytter, Efficient Parallel Algorithms (Cambridge University Press, Cambridge, 1988).
12. J. Machta and R. Greenlaw, The parallel complexity of growth models. J. Stat. Phys. 77:755 (1994).
13. J. Machta and R. Greenlaw. The computational complexity of generating random fractals, J. Stat. Phys. 82:1299 (1990).
14. H. Venkateswaran, Circuit definitions of nondeterministic complexity classes, SIAM J. Computing 21:655 (1992).
15. D. A. M. Barrington and N. Immerman, Time, hardware, and uniformity, in Structure in Complexity Theory: Ninth Annual Conference (1994), p. 176.