Algorithmic unsolvability of the triviality problem for certain classes of geometric structures
Article
Domain Context
Topology and Geometry
Citation
Alexander Nabutovsky and Shmuel Weinberger. (2000). Algorithmic unsolvability of the triviality problem for certain classes of geometric structures. Annals of Mathematics.
Why this reference is included
Nabutovsky and Weinberger’s Algorithmic unsolvability of the triviality problem for certain classes of geometric structures (2000) is part of the program’s reference corpus as standard domain context for Topology and Geometry. It is not directly cited in the currently published volumes of Panta Rhei, but is retained as part of the research shelf.
Corpus status
In the corpus only This reference is part of the research corpus but is not directly cited in the currently published volumes of Panta Rhei.