Lattice Gas Prediction is P-complete
| dc.creator | Moore, Cristopher | |
| dc.creator | Nordahl, Mats G. | |
| dc.date | 1997-04-17 | |
| dc.date.accessioned | 2026-07-07T09:11:06Z | |
| dc.date.available | 2026-07-07T09:11:06Z | |
| dc.description | We show that predicting the HPP or FHP III lattice gas for finite time is equivalent to calculating the output of an arbitrary Boolean circuit, and is therefore P-complete: that is, it is just as hard as any other problem solvable by a serial computer in polynomial time. It is widely believed in computer science that there are inherently sequential problems, for which parallel processing gives no significant speedup. Unless this is false, it is impossible even with highly parallel processing to predict lattice gases much faster than by explicit simulation. More precisely, we cannot predict t time-steps of a lattice gas in parallel computation time O(log^k t) for any k, or O(t^α) for α< 1/2, unless the class P is equal to the class NC or SP respectively. | |
| dc.description | 10 pages with figures | |
| dc.identifier | https://arxiv.org/abs/comp-gas/9704001 | |
| dc.identifier | http://arxiv.org/abs/comp-gas/9704001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151563 | |
| dc.subject | Cellular Automata and Lattice Gases | |
| dc.title | Lattice Gas Prediction is P-complete | |
| dc.type | text |