A polynomial solution for 3-SAT in the space of cellular automata in the hyperbolic plane

Journal of Universal Computer Science

Volumn 5, Issue 9, 1999, Pages 563-573

  Margenstern, Maurice ^a   Morita, Kenichi ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Cellular automata; Complexity theory; Hyperbolic plane

Indexed keywords

EID: 2442460321     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. [Carathéodory 54] C. Carathéodory. Theory of functions of a complex variable, vol.II, 177-184, Chelsea, New-York, 1954.
2. [Garey and Johnsohn 79] M.R. Garey, D.S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Co, San Francisco, 1979.
3. [Magnus 74] W. Magnus, Noneuclidean tessellations and their groups. Academic Press, New-York, 1974.
4. [Margenstern et al. 2000] Margenstern M., Morita K., NP problems are tractable in the space of cellular automata in the hyperbolic plane, accepted for publication in TCS, 37p.
5. [Maskit 71] Maskit. B. On Poincaré's theorem for fundamental polygons. Advances in Math., 7, 219-230, (1971).
6. [Meshkowski 64] H. Meschkowski, Noneuclidean geometry, translated by A. Shenitzer. Academic Press, New-York, 1964.
7. [Millman et al. 81] R.S. Millman, G.D. Parker, A metric approach with models. Springer-Verlag, New-York, 1981.
8. [Poincaré 1882] Poincaré H., Théorie des groupes fuchsiens. Acta Mathematica, 1, 1-62, (1882).
9. [Robinson 78] Robinson R.M. Undecidable tiling problems in the hyperbolic plane. Inventiones Mathematicae, 44, 259-264, (1978).