{"id":"https://openalex.org/W2046926619","doi":"https://doi.org/10.1016/s0020-0190(97)00054-9","title":"Large sets in AC0 have many strings with low Kolmogorov complexity","display_name":"Large sets in AC0 have many strings with low Kolmogorov complexity","publication_year":1997,"publication_date":"1997-05-01","ids":{"openalex":"https://openalex.org/W2046926619","doi":"https://doi.org/10.1016/s0020-0190(97)00054-9","mag":"2046926619"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(97)00054-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(97)00054-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-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/A5046763801","display_name":"Marius Zimand","orcid":"https://orcid.org/0000-0002-5938-6599"},"institutions":[{"id":"https://openalex.org/I130075709","display_name":"Georgia Southwestern State University","ror":"https://ror.org/044pfy487","country_code":"US","type":"education","lineage":["https://openalex.org/I130075709"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Marius Zimand","raw_affiliation_strings":["School of Computer & Applied Sciences, Georgia Southwestern State University, Americus, GA 31709, USA","School of Computer and Applied Sciences, Georgia Southwestern State University, Americus, GA 31709, USA"],"affiliations":[{"raw_affiliation_string":"School of Computer & Applied Sciences, Georgia Southwestern State University, Americus, GA 31709, USA","institution_ids":["https://openalex.org/I130075709"]},{"raw_affiliation_string":"School of Computer and Applied Sciences, Georgia Southwestern State University, Americus, GA 31709, USA","institution_ids":["https://openalex.org/I130075709"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046763801"],"corresponding_institution_ids":["https://openalex.org/I130075709"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.17902367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"62","issue":"3","first_page":"165","last_page":"170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9965000152587891,"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.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.8486040234565735},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6471423506736755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.571150004863739},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5630685091018677},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5190044641494751},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.50914067029953},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49922919273376465},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4733438789844513},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4372142255306244},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41753655672073364},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20668554306030273},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1860661804676056}],"concepts":[{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.8486040234565735},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6471423506736755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.571150004863739},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5630685091018677},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5190044641494751},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.50914067029953},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49922919273376465},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4733438789844513},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4372142255306244},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41753655672073364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20668554306030273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1860661804676056},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(97)00054-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(97)00054-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1638203394","https://openalex.org/W1985433872","https://openalex.org/W2023915883","https://openalex.org/W2069035846","https://openalex.org/W2111169889","https://openalex.org/W2159841662","https://openalex.org/W2281668463","https://openalex.org/W3003623942","https://openalex.org/W4300757861","https://openalex.org/W6646329910","https://openalex.org/W6658413905","https://openalex.org/W6683403658"],"related_works":["https://openalex.org/W2099977515","https://openalex.org/W2990853482","https://openalex.org/W2273702009","https://openalex.org/W61625408","https://openalex.org/W2374430960","https://openalex.org/W2327776271","https://openalex.org/W2041069649","https://openalex.org/W2047754121","https://openalex.org/W1589381382","https://openalex.org/W2461808546"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}