{"file":[{"creator":"system","access_level":"open_access","date_created":"2018-12-12T10:14:29Z","date_updated":"2020-07-14T12:45:48Z","relation":"main_file","checksum":"06c2ce5c1135fbc1f71ca15eeb242dcf","file_id":"5081","file_name":"IST-2016-533-v1+1_Extending_continuous_maps_polynomiality_and_undecidability.pdf","content_type":"application/pdf","file_size":447945}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Lukáš Vokřínek, and Uli Wagner. “Extending Continuous Maps: Polynomiality and Undecidability.” In *45th Annual ACM Symposium on Theory of Computing*, 595–604. ACM, 2013. https://doi.org/10.1145/2488608.2488683.","apa":"Čadek, M., Krcál, M., Matoušek, J., Vokřínek, L., & Wagner, U. (2013). Extending continuous maps: Polynomiality and undecidability. In *45th Annual ACM Symposium on theory of computing* (pp. 595–604). Palo Alto, CA, United States: ACM. https://doi.org/10.1145/2488608.2488683","ista":"Čadek M, Krcál M, Matoušek J, Vokřínek L, Wagner U. 2013. Extending continuous maps: Polynomiality and undecidability. 45th Annual ACM Symposium on theory of computing. STOC: Symposium on the Theory of Computing, 595–604.","ieee":"M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in *45th Annual ACM Symposium on theory of computing*, Palo Alto, CA, United States, 2013, pp. 595–604.","short":"M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, U. Wagner, in:, 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604.","ama":"Čadek M, Krcál M, Matoušek J, Vokřínek L, Wagner U. Extending continuous maps: Polynomiality and undecidability. In: *45th Annual ACM Symposium on Theory of Computing*. ACM; 2013:595-604. doi:10.1145/2488608.2488683","mla":"Čadek, Martin, et al. “Extending Continuous Maps: Polynomiality and Undecidability.” *45th Annual ACM Symposium on Theory of Computing*, ACM, 2013, pp. 595–604, doi:10.1145/2488608.2488683."},"page":"595 - 604","_id":"2807","pubrep_id":"533","publication_status":"published","date_updated":"2021-01-12T06:59:51Z","title":"Extending continuous maps: Polynomiality and undecidability","oa":1,"date_published":"2013-06-01T00:00:00Z","day":"01","type":"conference","quality_controlled":"1","oa_version":"Submitted Version","date_created":"2018-12-11T11:59:42Z","language":[{"iso":"eng"}],"year":"2013","abstract":[{"text":"We consider several basic problems of algebraic topology, with connections to combinatorial and geometric questions, from the point of view of computational complexity. The extension problem asks, given topological spaces X; Y , a subspace A ⊆ X, and a (continuous) map f : A → Y , whether f can be extended to a map X → Y . For computational purposes, we assume that X and Y are represented as finite simplicial complexes, A is a subcomplex of X, and f is given as a simplicial map. In this generality the problem is undecidable, as follows from Novikov's result from the 1950s on uncomputability of the fundamental group π1(Y ). We thus study the problem under the assumption that, for some k ≥ 2, Y is (k - 1)-connected; informally, this means that Y has \\no holes up to dimension k-1" (a basic example of such a Y is the sphere Sk). We prove that, on the one hand, this problem is still undecidable for dimX = 2k. On the other hand, for every fixed k ≥ 2, we obtain an algorithm that solves the extension problem in polynomial time assuming Y (k - 1)-connected and dimX ≤ 2k - 1. For dimX ≤ 2k - 2, the algorithm also provides a classification of all extensions up to homotopy (continuous deformation). This relies on results of our SODA 2012 paper, and the main new ingredient is a machinery of objects with polynomial-time homology, which is a polynomial-time analog of objects with effective homology developed earlier by Sergeraert et al. We also consider the computation of the higher homotopy groups πk(Y ), k ≥ 2, for a 1-connected Y . Their computability was established by Brown in 1957; we show that πk(Y ) can be computed in polynomial time for every fixed k ≥ 2. On the other hand, Anick proved in 1989 that computing πk(Y ) is #P-hard if k is a part of input, where Y is a cell complex with certain rather compact encoding. We strengthen his result to #P-hardness for Y given as a simplicial complex. ","lang":"eng"}],"status":"public","author":[{"last_name":"Čadek","full_name":"Čadek, Martin","first_name":"Martin"},{"last_name":"Krcál","full_name":"Krcál, Marek","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jiří","last_name":"Matoušek","full_name":"Matoušek, Jiří"},{"full_name":"Vokřínek, Lukáš","last_name":"Vokřínek","first_name":"Lukáš"},{"orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"month":"06","publication":"45th Annual ACM Symposium on theory of computing","ddc":["510"],"publist_id":"4078","has_accepted_license":"1","conference":{"name":"STOC: Symposium on the Theory of Computing","end_date":"2013-06-04","location":"Palo Alto, CA, United States","start_date":"2013-06-01"},"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:48Z","publisher":"ACM","doi":"10.1145/2488608.2488683","scopus_import":1}