{"id":"https://openalex.org/W2085112631","doi":"https://doi.org/10.1016/s0304-3975(01)00035-4","title":"Logical operations and Kolmogorov complexity","display_name":"Logical operations and Kolmogorov complexity","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2085112631","doi":"https://doi.org/10.1016/s0304-3975(01)00035-4","mag":"2085112631"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00035-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00035-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","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/A5083603294","display_name":"Alexander Shen","orcid":"https://orcid.org/0000-0001-8605-7734"},"institutions":[{"id":"https://openalex.org/I4210107660","display_name":"Institute for Information Transmission Problems","ror":"https://ror.org/013w2d378","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210107660"]},{"id":"https://openalex.org/I69295118","display_name":"Independent University of Moscow","ror":"https://ror.org/00ygzyy93","country_code":"RU","type":"education","lineage":["https://openalex.org/I69295118"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander Shen","raw_affiliation_strings":["Institute of Problems of Information Transmission (Moscow), Independent University of Moscow, Russia","Independent University of Moscow, Moscow, Russia#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute of Problems of Information Transmission (Moscow), Independent University of Moscow, Russia","institution_ids":["https://openalex.org/I4210107660","https://openalex.org/I69295118"]},{"raw_affiliation_string":"Independent University of Moscow, Moscow, Russia#TAB#","institution_ids":["https://openalex.org/I69295118"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081932577","display_name":"Nikolay Vereshchagin","orcid":"https://orcid.org/0000-0002-7386-979X"},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Nikolai Vereshchagin","raw_affiliation_strings":["Department of Mathematical Logic and Theory of Algorithms, Moscow State University, Vorobjevy Gory, Moscow 119899, Russia","Moscow State University, Moscow,#N#Russia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Logic and Theory of Algorithms, Moscow State University, Vorobjevy Gory, Moscow 119899, Russia","institution_ids":["https://openalex.org/I19880235"]},{"raw_affiliation_string":"Moscow State University, Moscow,#N#Russia","institution_ids":["https://openalex.org/I19880235"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081932577"],"corresponding_institution_ids":["https://openalex.org/I19880235"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":2.0997,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.87350476,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"271","issue":"1-2","first_page":"125","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.991100013256073,"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/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9876000285148621,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/realizability","display_name":"Realizability","score":0.9441637992858887},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.8650213479995728},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.7474069595336914},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.572677493095398},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.5705390572547913},{"id":"https://openalex.org/keywords/kolmogorov-structure-function","display_name":"Kolmogorov structure function","score":0.5086813569068909},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4835221767425537},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.45073404908180237},{"id":"https://openalex.org/keywords/algorithmic-complexity","display_name":"Algorithmic complexity","score":0.4237605035305023},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3876959979534149},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3791426420211792},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3507201671600342},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3170860707759857},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.28436577320098877},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.21573758125305176}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.9441637992858887},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.8650213479995728},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.7474069595336914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.572677493095398},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.5705390572547913},{"id":"https://openalex.org/C15995199","wikidata":"https://www.wikidata.org/wiki/Q5805968","display_name":"Kolmogorov structure function","level":3,"score":0.5086813569068909},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4835221767425537},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.45073404908180237},{"id":"https://openalex.org/C2983064736","wikidata":"https://www.wikidata.org/wiki/Q20779668","display_name":"Algorithmic complexity","level":2,"score":0.4237605035305023},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3876959979534149},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3791426420211792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3507201671600342},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3170860707759857},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28436577320098877},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.21573758125305176},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(01)00035-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00035-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.25.4566","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.4566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lpcs.math.msu.ru/~ver/papers/logpbs.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1483568252","https://openalex.org/W1998290842","https://openalex.org/W2051685387"],"related_works":["https://openalex.org/W2035556343","https://openalex.org/W61625408","https://openalex.org/W2133970945","https://openalex.org/W1488487350","https://openalex.org/W2273702009","https://openalex.org/W2395356117","https://openalex.org/W2289000419","https://openalex.org/W2735609692","https://openalex.org/W3023658018","https://openalex.org/W2461671499"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}