NP problems are tractable in the space of cellular automata in the hyperbolic plane

Theoretical Computer Science

Volumn 259, Issue 1-2, 2001, Pages 99-128

  Margenstern, Maurice ^a   Morita, Kenichi ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Cellular automata; Hyperbolic geometry; Time complexity

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL GEOMETRY; POLYNOMIALS;

CELLULAR AUTOMATA;

COMPUTATIONAL COMPLEXITY;

EID: 0034914491     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00328-X     Document Type: Article

References (14)

1. Polynomial time approximation schemes for euclidean TSP and other geometric problems
2. Kolmogorov machines and related issues
3. On Poincaré's theorem for fundamental polygons
4. Théorie des groupes fuchsiens
5. Undecidable tiling problems in the hyperbolic plane
6. On the approximability of the multidimensional euclidean, TSP