Computational complexity in the hyperbolic plane

DOI10.1007/3-540-45687-2_30MaRDI QIDQ4708585zbMATH OpenFDO

Authors C. Iwamoto, Takeshi Andou, Katsunobu Imai, Kenichi Morita

Publication date 18 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200365.htm

zbMATH Keywords

cellular automatacomplexityhyperbolic geometry

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 2040939
• Cellular automata and hyperbolic spaces
• A universal cellular automaton in the hyperbolic plane.
• A Time Hierarchy Theorem for Nondeterministic Cellular Automata
• scientific article; zbMATH DE number 1886330

Cited in

(7)

• Computing hypercircles by moving hyperplanes
• Multiple Fibonacci trees
• scientific article; zbMATH DE number 6820278 (Why is no real title available?)
• Hyperbolic Dimension and Decomposition Complexity
• A Time Hierarchy Theorem for Nondeterministic Cellular Automata
• scientific article; zbMATH DE number 6322905 (Why is no real title available?)
• Computational hyperbolicity

This page was built for publication: Computational complexity in the hyperbolic plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708585)