Další formáty:
BibTeX
LaTeX
RIS
@article{1161826,
author = {Čadek, Martin and Krčál, Marek and Matoušek, Jiří and Vokřínek, Lukáš and Wagner, Uli},
article_number = {1},
doi = {http://dx.doi.org/10.1007/s00454-013-9551-8},
keywords = {extension problem ; homotopy group; undecidability; hardness},
language = {eng},
issn = {0179-5376},
journal = {Discrete & Computational Geometry},
title = {Extendability of Continuous Maps Is Undecidable},
url = {http://link.springer.com/article/10.1007/s00454-013-9551-8/fulltext.html},
volume = {51},
year = {2014}
}
TY - JOUR
ID - 1161826
AU - Čadek, Martin - Krčál, Marek - Matoušek, Jiří - Vokřínek, Lukáš - Wagner, Uli
PY - 2014
TI - Extendability of Continuous Maps Is Undecidable
JF - Discrete & Computational Geometry
VL - 51
IS - 1
SP - 24-66
EP - 24-66
SN - 01795376
KW - extension problem
KW - homotopy group
KW - undecidability
KW - hardness
UR - http://link.springer.com/article/10.1007/s00454-013-9551-8/fulltext.html
L2 - http://link.springer.com/article/10.1007/s00454-013-9551-8/fulltext.html
N2 - Given topological spaces X and Y, a subspace A of X, and a continuous map f from A to Y, decide whether f can be extended to a continuous map F from X to Y. All spaces are given as finite simplicial complexes, and the map f is simplicial. The paper shows that for dimX=2k, the extension problem with (k minus 1) connected Y becomes undecidable.
ER -
ČADEK, Martin, Marek KRČÁL, Jiří MATOUŠEK, Lukáš VOKŘÍNEK a Uli WAGNER. Extendability of Continuous Maps Is Undecidable. Online. \textit{Discrete \&{} Computational Geometry}. 2014, roč.~51, č.~1, s.~24-66. ISSN~0179-5376. Dostupné z: https://dx.doi.org/10.1007/s00454-013-9551-8. [citováno 2024-04-23]
|
