{"id":"https://openalex.org/W2531200539","doi":"https://doi.org/10.1145/2933575.2935311","title":"Complexity Theory of (Functions on) Compact Metric Spaces","display_name":"Complexity Theory of (Functions on) Compact Metric Spaces","publication_year":2016,"publication_date":"2016-07-05","ids":{"openalex":"https://openalex.org/W2531200539","doi":"https://doi.org/10.1145/2933575.2935311","mag":"2531200539"},"language":"en","primary_location":{"id":"doi:10.1145/2933575.2935311","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933575.2935311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074573236","display_name":"Akitoshi Kawamura","orcid":"https://orcid.org/0009-0006-3706-7470"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Akitoshi Kawamura","raw_affiliation_strings":["The University of Tokyo"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108295991","display_name":"Florian Steinberg","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Florian Steinberg","raw_affiliation_strings":["TU Darmstadt"],"affiliations":[{"raw_affiliation_string":"TU Darmstadt","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101546631","display_name":"Martin Ziegler","orcid":"https://orcid.org/0000-0001-6734-7875"},"institutions":[{"id":"https://openalex.org/I4210099236","display_name":"Kootenay Association for Science & Technology","ror":"https://ror.org/011pv9p44","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I4210099236"]},{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["CA","KR"],"is_corresponding":false,"raw_author_name":"Martin Ziegler","raw_affiliation_strings":["KAIST"],"affiliations":[{"raw_affiliation_string":"KAIST","institution_ids":["https://openalex.org/I4210099236","https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074573236"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":1.7424,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86476748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"837","last_page":"846"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6515265703201294},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5745304226875305},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.5561288595199585},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5470484495162964},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5450326800346375},{"id":"https://openalex.org/keywords/ph","display_name":"PH","score":0.5191649198532104},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4933237135410309},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.4726238250732422},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.4710255265235901},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4656551480293274},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42064374685287476},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4188106656074524},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3508528470993042},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.3369695544242859},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.31625938415527344},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2600116729736328},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24917790293693542},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24268239736557007},{"id":"https://openalex.org/keywords/quantum-information","display_name":"Quantum information","score":0.09994712471961975}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6515265703201294},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5745304226875305},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.5561288595199585},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5470484495162964},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5450326800346375},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.5191649198532104},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4933237135410309},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.4726238250732422},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.4710255265235901},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4656551480293274},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42064374685287476},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4188106656074524},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3508528470993042},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.3369695544242859},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.31625938415527344},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2600116729736328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24917790293693542},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24268239736557007},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.09994712471961975},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2933575.2935311","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933575.2935311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W107779203","https://openalex.org/W129705174","https://openalex.org/W223861748","https://openalex.org/W235490522","https://openalex.org/W295484097","https://openalex.org/W1497475168","https://openalex.org/W1498085647","https://openalex.org/W1509579779","https://openalex.org/W1512638263","https://openalex.org/W1517036688","https://openalex.org/W1517853613","https://openalex.org/W1533082689","https://openalex.org/W1540827327","https://openalex.org/W1568076086","https://openalex.org/W1582285885","https://openalex.org/W1583458798","https://openalex.org/W1835642604","https://openalex.org/W1965442792","https://openalex.org/W1975831503","https://openalex.org/W1978001037","https://openalex.org/W1980256844","https://openalex.org/W2006786362","https://openalex.org/W2015523765","https://openalex.org/W2020430463","https://openalex.org/W2023572360","https://openalex.org/W2036258793","https://openalex.org/W2047923539","https://openalex.org/W2054193960","https://openalex.org/W2063926602","https://openalex.org/W2072573877","https://openalex.org/W2075728787","https://openalex.org/W2080359559","https://openalex.org/W2114124105","https://openalex.org/W2117033549","https://openalex.org/W2167006824","https://openalex.org/W2169277847","https://openalex.org/W2169881901","https://openalex.org/W2207885555","https://openalex.org/W2296959149","https://openalex.org/W2570115677","https://openalex.org/W2575902066","https://openalex.org/W2950792444","https://openalex.org/W2977793662","https://openalex.org/W3098868977","https://openalex.org/W6608804813","https://openalex.org/W6632012709","https://openalex.org/W6634902890"],"related_works":["https://openalex.org/W2105038944","https://openalex.org/W4294266235","https://openalex.org/W2047754121","https://openalex.org/W2072410898","https://openalex.org/W342214647","https://openalex.org/W2029183607","https://openalex.org/W2374430960","https://openalex.org/W1579803260","https://openalex.org/W2289000419","https://openalex.org/W2461808546"],"abstract_inverted_index":{"We":[0],"promote":[1],"the":[2,16,31,53,99,131,141,164],"theory":[3,33],"of":[4,14,20,29,52,55,91,103,107,124,140,143,150,199],"computational":[5,72],"complexity":[6,102,200],"on":[7,34,74,110],"metric":[8,94],"spaces:":[9],"as":[10,26,28,48,70,136,185],"natural":[11],"common":[12],"generalization":[13],"(i)":[15],"classical":[17,78],"discrete":[18],"setting":[19],"integers,":[21],"binary":[22,138,179],"strings,":[23],"graphs":[24],"etc.":[25],"well":[27],"(ii)":[30],"bit-complexity":[32],"real":[35],"numbers":[36],"and":[37,58,66,69,86,121,170],"functions":[38,109,181],"according":[39],"to":[40,98,163],"Friedman,":[41],"Ko":[42],"(1982ff),":[43],"Cook,":[44],"Braverman":[45],"et":[46],"al.;":[47],"(iii)":[49],"resource-bounded":[50],"refinement":[51],"theories":[54],"computability":[56],"on,":[57],"representations":[59],"of,":[60,176],"continuous":[61,108],"universes":[62],"by":[63,117,187],"Pour-El&Richards":[64],"(1989)":[65],"Weihrauch":[67],"(1993ff);":[68],"(iv)":[71],"perspective":[73],"quantitative":[75],"concepts":[76],"from":[77,159],"Analysis:":[79],"Our":[80],"main":[81],"results":[82],"relate":[83],"(i.e.":[84,134],"upper":[85,113],"lower":[87,154],"bound)":[88],"Kolmogorov's":[89],"entropy":[90],"a":[92],"compact":[93],"space":[95],"X":[96],"polynomially":[97],"uniform":[100],"relativized":[101],"approximating":[104],"various":[105],"families":[106],"X.":[111],"The":[112,153],"bounds":[114,155],"are":[115],"attained":[116],"carefully":[118],"crafted":[119],"oracles":[120],"bit-cost":[122],"analyses":[123],"algorithms":[125],"perusing":[126],"them.":[127],"They":[128,167],"all":[129],"employ":[130],"same":[132],"representation":[133],"encoding,":[135],"infinite":[137],"sequences,":[139],"elements)":[142],"such":[144],"spaces,":[145],"which":[146],"thus":[147],"may":[148],"be":[149],"own":[151],"interest.":[152],"adapt":[156],"adversary":[157],"arguments":[158],"unit-cost":[160],"Information-Based":[161],"Complexity":[162],"bit":[165],"model.":[166],"extend":[168],"to,":[169],"indicate":[171],"perhaps":[172],"surprising":[173],"limitations":[174],"even":[175],"encodings":[177],"via":[178],"string":[180],"(rather":[182],"than":[183],"sequences)":[184],"introduced":[186],"Kawamura&Cook":[188],"(SToC'2010,":[189],"\u00a73.4).":[190],"These":[191],"insights":[192],"offer":[193],"some":[194],"guidance":[195],"towards":[196],"suitable":[197],"notions":[198],"for":[201],"higher":[202],"types.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}