{"isi":1,"project":[{"_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory","grant_number":"P31312","call_identifier":"FWF"}],"intvolume":" 20","volume":20,"year":"2020","citation":{"ama":"Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x","chicago":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics. Springer Nature, 2020. https://doi.org/10.1007/s10208-019-09419-x.","ista":"Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.","apa":"Filakovský, M., & Vokřínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. Springer Nature. https://doi.org/10.1007/s10208-019-09419-x","short":"M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330.","mla":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.","ieee":"M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic viewpoint,” Foundations of Computational Mathematics, vol. 20. Springer Nature, pp. 311–330, 2020."},"article_type":"original","_id":"6563","language":[{"iso":"eng"}],"publication":"Foundations of Computational Mathematics","author":[{"full_name":"Filakovský, Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","last_name":"Filakovský","first_name":"Marek"},{"first_name":"Lukas","last_name":"Vokřínek","full_name":"Vokřínek, Lukas"}],"page":"311-330","doi":"10.1007/s10208-019-09419-x","external_id":{"arxiv":["1312.2337"],"isi":["000522437400004"]},"publication_identifier":{"issn":["16153375"],"eissn":["16153383"]},"quality_controlled":"1","title":"Are two given maps homotopic? An algorithmic viewpoint","status":"public","oa_version":"Preprint","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2019-06-16T21:59:14Z","publisher":"Springer Nature","scopus_import":"1","publication_status":"published","date_published":"2020-04-01T00:00:00Z","department":[{"_id":"UlWa"}],"abstract":[{"text":"This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps 𝑓,𝑔:𝑋→𝑌, and the second computes the group [𝛴𝑋,𝑌]∗ of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to 𝐴⊆𝑋.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1312.2337"}],"type":"journal_article","day":"01","month":"04","article_processing_charge":"No","date_updated":"2023-08-17T13:50:44Z"}