Polynomial-Time Homology for Simplicial Eilenberg–MacLane Spaces-Reference-Cited by-同舟云学术

Polynomial-Time Homology for Simplicial Eilenberg–MacLane Spaces

Published:2013-05-30 Issue:6 Volume:13 Page:935-963
ISSN:1615-3375
Container-title:Foundations of Computational Mathematics
language:en
Short-container-title:Found Comput Math

Author:

Krčál Marek,Matoušek Jiří,Sergeraert Francis

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis

Link

http://link.springer.com/content/pdf/10.1007/s10208-013-9159-7.pdf

Reference23 articles.

1. Lect. Notes Pure Appl. Math.;D.J. Anick,1989

2. M. Čadek, M. Krčál, J. Matoušek, F. Sergeraert, L. Vokřínek, U. Wagner, Computing all maps into a sphere. Preprint arXiv:1105.6257 (2011). Extended abstract in Proc. ACM–SIAM Symposium on Discrete Algorithms (SODA 2012).

3. M. Čadek, M. Krčál, J. Matoušek, L. Vokřínek, U. Wagner, Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension. Preprint arXiv:1211.3093 (2012).

4. M. Čadek, M. Krčál, J. Matoušek, L. Vokřínek, U. Wagner, Extendability of continuous maps is undecidable. Preprint arXiv:1302.2370 (2013).

5. Exposés 2 à 16, Séminaire Henri Cartan;H. Cartan,1956

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cohomology with local coefficients and knotted manifolds;Journal of Symbolic Computation;2021-11

2. Embeddability in R 3 is NP-hard;Journal of the ACM;2020-08-13

3. Computing simplicial representatives of homotopy group elements;Journal of Applied and Computational Topology;2018-09-25

4. Embeddability in the 3-Sphere Is Decidable;Journal of the ACM;2018-01-24

5. A Bousfield–Kan Algorithm for Computing the Effective Homotopy of a Space;Foundations of Computational Mathematics;2016-05-02