Další formáty:
BibTeX
LaTeX
RIS
@article{1203586, author = {Čadek, Martin and Krčál, Marek and Matoušek, Jiří and Vokřínek, Lukáš and Wagner, Uli}, article_location = {USA}, article_number = {5}, doi = {http://dx.doi.org/10.1137/120899029}, keywords = {homotopy groups; Postnikov systems; computational complexity}, language = {eng}, issn = {0097-5397}, journal = {SIAM Journal on Computing}, title = {Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension}, url = {http://dx.doi.org/10.1137/120899029}, volume = {43}, year = {2014} }
TY - JOUR ID - 1203586 AU - Čadek, Martin - Krčál, Marek - Matoušek, Jiří - Vokřínek, Lukáš - Wagner, Uli PY - 2014 TI - Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension JF - SIAM Journal on Computing VL - 43 IS - 5 SP - 1728-1780 EP - 1728-1780 PB - SIAM SN - 00975397 KW - homotopy groups KW - Postnikov systems KW - computational complexity UR - http://dx.doi.org/10.1137/120899029 L2 - http://dx.doi.org/10.1137/120899029 N2 - For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed integer k, there is a polynomial-time algorithm that, for a one-connected topological space given as a simplicial set with polynomial-time homology, computes its k-th homotopy group, as well as the first k stages of its Postnikov system. ER -
ČADEK, Martin, Marek KRČÁL, Jiří MATOUŠEK, Lukáš VOKŘÍNEK a Uli WAGNER. Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension. \textit{SIAM Journal on Computing}. USA: SIAM, 2014, roč.~43, č.~5, s.~1728-1780. ISSN~0097-5397. Dostupné z: https://dx.doi.org/10.1137/120899029.
|