暂无分享,去创建一个
[1] Uli Wagner,et al. Embeddability of Simplicial Complexes is Undecidable , 2020, SODA.
[2] Martin Tancer,et al. Hardness of almost embedding simplicial complexes in Rd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {R}^d$$ , 2018, Discrete & Computational Geometry.
[3] A. Skopenkov,et al. Some 'converses' to intrinsic linking theorems , 2020, ArXiv.
[4] A. Skopenkov,et al. On the deleted product criterion for embeddability in $\mathbb R^m$ , 1998 .
[5] Arkadiy Skopenkov,et al. Invariants of Graph Drawings in the Plane , 2018, ArXiv.
[6] Shmuel Weinberger,et al. Algorithmic aspects of homeomorphism problems , 1997 .
[7] J. Matousek,et al. Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry , 2007 .
[8] A. Skopenkov. Surveys in Contemporary Mathematics: Embedding and knotting of manifolds in Euclidean spaces , 2006, math/0604045.
[9] A. Skopenkov. On different reliability standards in current mathematical research , 2021 .
[10] Jack Segal,et al. Quasi embeddings and embeddings of polyhedra in Rm , 1992 .
[11] C. Weber. Plongements de polyèdres dans le domaine métastable , 1967 .
[12] Jirí Matousek,et al. Hardness of embedding simplicial complexes in Rd , 2009, SODA.
[13] J. L. Bryant. Piecewise Linear Topology , 2001 .
[14] Jirí Matousek,et al. Extendability of Continuous Maps Is Undecidable , 2013, Discret. Comput. Geom..
[15] A. Skopenkov,et al. Algebraic topology from geometric viewpoint , 2008, 0808.1395.