{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:33:50Z","timestamp":1725863630235},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:00:00Z","timestamp":1559088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:00:00Z","timestamp":1559088000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10208-019-09419-x","type":"journal-article","created":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T20:26:13Z","timestamp":1559161573000},"page":"311-330","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Are Two Given Maps Homotopic? An Algorithmic Viewpoint"],"prefix":"10.1007","volume":"20","author":[{"given":"M.","family":"Filakovsk\u00fd","sequence":"first","affiliation":[]},{"given":"L.","family":"Vok\u0159\u00ednek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,29]]},"reference":[{"key":"9419_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1969664","volume":"65","author":"EH Brown","year":"1957","unstructured":"E. H. Brown. Finite computability of Postnikov complexes. Ann. Math.\u00a065 (1957), 1\u201320.","journal-title":"Ann. Math."},{"key":"9419_CR2","doi-asserted-by":"crossref","unstructured":"M.\u00a0\u010cadek, M.\u00a0Kr\u010d\u00e1l, J.\u00a0Matou\u0161ek, F.\u00a0Sergeraert, L.\u00a0Vok\u0159\u00ednek, U.\u00a0Wagner. Computing all maps into a sphere. J. ACM\u00a061 (2014), 17:1\u201344.","DOI":"10.1145\/2597629"},{"key":"9419_CR3","doi-asserted-by":"crossref","unstructured":"M.\u00a0\u010cadek, M.\u00a0Kr\u010d\u00e1l, J.\u00a0Matou\u0161ek, L.\u00a0Vok\u0159\u00ednek, U.\u00a0Wagner. Extendability of continuous maps is undecidable. Discr. Comput. Geom.\u00a051 (2014), 24\u201366.","DOI":"10.1007\/s00454-013-9551-8"},{"key":"9419_CR4","doi-asserted-by":"crossref","unstructured":"M.\u00a0\u010cadek, M.\u00a0Kr\u010d\u00e1l, J.\u00a0Matou\u0161ek, L.\u00a0Vok\u0159\u00ednek, U.\u00a0Wagner. Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension. SIAM J. Comput.\u00a043 (2014), 1728\u20131780.","DOI":"10.1137\/120899029"},{"key":"9419_CR5","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s00454-016-9855-6","volume":"57","author":"M \u010cadek","year":"2017","unstructured":"M.\u00a0\u010cadek, M.\u00a0Kr\u010d\u00e1l, L.\u00a0Vok\u0159\u00ednek. Algorithmic solvability of the lifting-extension problem. In: Discr. Comput. Geom.\u00a057 (2017), pp. 915\u2013965.","journal-title":"Discr. Comput. Geom."},{"key":"9419_CR6","unstructured":"B.\u00a0Eick, M.\u00a0Horn, W.\u00a0Nickel. Manual for the polycyclic package in GAP. \nhttps:\/\/www.gap-system.org\/Manuals\/pkg\/polycyclic-2.11\/doc\/manual.pdf\n\n, (2013). Accessed 6 May 2019."},{"key":"9419_CR7","unstructured":"V.\u00a0Gebhardt. Magma Handbook, Polycyclic groups. \nhttps:\/\/magma.maths.usyd.edu.au\/magma\/handbook\/polycyclic_groups\n\n. Accessed 6 May 2019."},{"key":"9419_CR8","first-page":"1","volume":"44","author":"PS Novikov","year":"1955","unstructured":"P.\u00a0S.\u00a0Novikov. On the algorithmic unsolvability of the word problem in group theory (in Russian). Trudy Mat. Inst. im. Steklova\u00a044 (1955), 1\u2013143.","journal-title":"Trudy Mat. Inst. im. Steklova"},{"key":"9419_CR9","volume-title":"Simplicial Objects in Algebraic Topology","author":"JP May","year":"1992","unstructured":"J.\u00a0P.\u00a0May. Simplicial Objects in Algebraic Topology. University of Chicago Press, Chicago, IL, (1992)."},{"key":"9419_CR10","unstructured":"J.\u00a0Rubio, F.\u00a0Sergeraert. Constructive homological algebra and applications. Preprint, \narXiv:1208.3816\n\n, 2012. Written in 2006 for a MAP Summer School at the University of Genova."},{"key":"9419_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574702","volume-title":"Computation with Finitely Presented Groups","author":"CC Sims","year":"1994","unstructured":"C.\u00a0C.\u00a0Sims. Computation with Finitely Presented Groups. Cambridge University Press, Cambridge, (1994)."},{"key":"9419_CR12","doi-asserted-by":"crossref","unstructured":"A.\u00a0Storjohann. Near optimal algorithms for computing Smith normal forms of integer matrices. In Proceedings of the 1996 international symposium on Symbolic and algebraic computation, ACM, pp. 267\u2013274","DOI":"10.1145\/236869.237084"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-019-09419-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-019-09419-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-019-09419-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T23:24:08Z","timestamp":1590621848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-019-09419-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,29]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9419"],"URL":"https:\/\/doi.org\/10.1007\/s10208-019-09419-x","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,29]]},"assertion":[{"value":"22 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}