scientific article; zbMATH DE number 5734572

MaRDI QIDQ3574138zbMATH OpenFDO

Authors Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Robert A. Hearn, Timo von Oertzen

Publication date 9 July 2010

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Recommendations

• Topological complexity of the telescope
• The Mathematics of “Go To” Telescopes
• Complexity in de Sitter space
• scientific article; zbMATH DE number 1107663
• scientific article; zbMATH DE number 65897
• Remarks on black hole complexity puzzle
• Complexity and behind the horizon cut off
• Debugging the universe

Cited in

(4)

• scientific article; zbMATH DE number 65897 (Why is no real title available?)
• Phutball is PSPACE-hard
• Defying gravity and gadget numerosity: the complexity of the Hanano puzzle
• Topological complexity of the telescope

This page was built for publication:

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