{"id":"https://openalex.org/W2522274696","doi":"https://doi.org/10.3390/axioms10040334","title":"List Approximation for Increasing Kolmogorov Complexity","display_name":"List Approximation for Increasing Kolmogorov Complexity","publication_year":2021,"publication_date":"2021-12-07","ids":{"openalex":"https://openalex.org/W2522274696","doi":"https://doi.org/10.3390/axioms10040334","mag":"2522274696"},"language":"en","primary_location":{"id":"doi:10.3390/axioms10040334","is_oa":true,"landing_page_url":"https://doi.org/10.3390/axioms10040334","pdf_url":"https://www.mdpi.com/2075-1680/10/4/334/pdf?version=1638843668","source":{"id":"https://openalex.org/S4210173132","display_name":"Axioms","issn_l":"2075-1680","issn":["2075-1680"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Axioms","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2075-1680/10/4/334/pdf?version=1638843668","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046763801","display_name":"Marius Zimand","orcid":"https://orcid.org/0000-0002-5938-6599"},"institutions":[{"id":"https://openalex.org/I4322298","display_name":"Towson University","ror":"https://ror.org/044w7a341","country_code":"US","type":"education","lineage":["https://openalex.org/I4322298"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Marius Zimand","raw_affiliation_strings":["Department of Computer and Information Sciences, Towson University, Baltimore, MD 21252, USA","Towson University, Towson, United States"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Towson University, Baltimore, MD 21252, USA","institution_ids":["https://openalex.org/I4322298"]},{"raw_affiliation_string":"Towson University, Towson, United States","institution_ids":["https://openalex.org/I4322298"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046763801"],"corresponding_institution_ids":["https://openalex.org/I4322298"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.1515,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.45953848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":"4","first_page":"334","last_page":"334"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9991000294685364,"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":0.9991000294685364,"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.9976000189781189,"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.9934999942779541,"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/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.8760648965835571},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.7792422771453857},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.6153038740158081},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.595711886882782},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5850812196731567},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5586961507797241},{"id":"https://openalex.org/keywords/kolmogorov-structure-function","display_name":"Kolmogorov structure function","score":0.5188199877738953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4902530312538147},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4742295444011688},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4540392756462097},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4517884850502014},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4344162940979004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33173468708992004},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2756466269493103},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07127213478088379}],"concepts":[{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.8760648965835571},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.7792422771453857},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.6153038740158081},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.595711886882782},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5850812196731567},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5586961507797241},{"id":"https://openalex.org/C15995199","wikidata":"https://www.wikidata.org/wiki/Q5805968","display_name":"Kolmogorov structure function","level":3,"score":0.5188199877738953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4902530312538147},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4742295444011688},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4540392756462097},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4517884850502014},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4344162940979004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33173468708992004},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2756466269493103},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07127213478088379},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.3390/axioms10040334","is_oa":true,"landing_page_url":"https://doi.org/10.3390/axioms10040334","pdf_url":"https://www.mdpi.com/2075-1680/10/4/334/pdf?version=1638843668","source":{"id":"https://openalex.org/S4210173132","display_name":"Axioms","issn_l":"2075-1680","issn":["2075-1680"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Axioms","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1609.05984","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.05984","pdf_url":"https://arxiv.org/pdf/1609.05984","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"text"},{"id":"mag:2522274696","is_oa":true,"landing_page_url":"https://www.arxiv.org/pdf/1609.05984","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:doaj.org/article:253d1fb32ec64e83b26f74a8688d3e08","is_oa":true,"landing_page_url":"https://doaj.org/article/253d1fb32ec64e83b26f74a8688d3e08","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Axioms, Vol 10, Iss 4, p 334 (2021)","raw_type":"article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:7034","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.58","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:mdpi.com:/2075-1680/10/4/334/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/axioms10040334","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Axioms; Volume 10; Issue 4; Pages: 334","raw_type":"Text"},{"id":"doi:10.48550/arxiv.1609.05984","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1609.05984","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.stacs.2017.58","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2017.58","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.3390/axioms10040334","is_oa":true,"landing_page_url":"https://doi.org/10.3390/axioms10040334","pdf_url":"https://www.mdpi.com/2075-1680/10/4/334/pdf?version=1638843668","source":{"id":"https://openalex.org/S4210173132","display_name":"Axioms","issn_l":"2075-1680","issn":["2075-1680"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Axioms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4158515515","display_name":null,"funder_award_id":"CCF 1811729","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2522274696.pdf","grobid_xml":"https://content.openalex.org/works/W2522274696.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1574049752","https://openalex.org/W1581602411","https://openalex.org/W1601197949","https://openalex.org/W1987249556","https://openalex.org/W1997686864","https://openalex.org/W2022038544","https://openalex.org/W2077050034","https://openalex.org/W2119913278","https://openalex.org/W2260000333","https://openalex.org/W2318076643","https://openalex.org/W2343971969","https://openalex.org/W2522274696","https://openalex.org/W2953227235","https://openalex.org/W2995706057"],"related_works":["https://openalex.org/W2952147765","https://openalex.org/W3037693696","https://openalex.org/W1558040305","https://openalex.org/W24635339","https://openalex.org/W2155949379","https://openalex.org/W2264676752","https://openalex.org/W2257055501","https://openalex.org/W2950888188","https://openalex.org/W3044650145","https://openalex.org/W2436540252","https://openalex.org/W2754226771","https://openalex.org/W3069814052","https://openalex.org/W3210065045","https://openalex.org/W2783685616","https://openalex.org/W2900385277","https://openalex.org/W3147316689","https://openalex.org/W86329357","https://openalex.org/W1800055261","https://openalex.org/W1968735844","https://openalex.org/W2952454961"],"abstract_inverted_index":{"It":[0],"is":[1,16,43,85],"impossible":[2],"to":[3,10,19],"effectively":[4],"modify":[5],"a":[6,21,53,61,96],"string":[7,54],"in":[8,101,108],"order":[9],"increase":[11],"its":[12],"Kolmogorov":[13],"complexity.":[14],"However,":[15],"it":[17],"possible":[18],"construct":[20],"few":[22],"strings,":[23,65],"no":[24],"longer":[25],"than":[26,78,87],"the":[27,41,81],"input":[28,52],"string,":[29],"so":[30],"that":[31,40,49,71,94],"most":[32],"of":[33,56,67,73,83,98],"them":[34,74],"have":[35],"larger":[36],"complexity?":[37],"We":[38,45,89],"show":[39],"answer":[42],"yes.":[44],"present":[46,91],"an":[47,92],"algorithm":[48,93],"takes":[50],"as":[51],"x":[55,84],"length":[57,68],"n":[58],"and":[59],"returns":[60],"list":[62,97],"with":[63],"O(n2)":[64],"all":[66],"n,":[69],"such":[70],"99%":[72],"are":[75],"more":[76],"complex":[77],"x,":[79],"provided":[80],"complexity":[82],"less":[86],"n\u2212loglogn\u2212O(1).":[88],"also":[90],"obtains":[95],"quasi-polynomial":[99],"size":[100],"which":[102],"each":[103],"element":[104],"can":[105],"be":[106],"produced":[107],"polynomial":[109],"time.":[110]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}