{"id":"https://openalex.org/W2033194803","doi":"https://doi.org/10.1016/s0304-3975(01)00039-1","title":"General linear relations between different types of predictive complexity","display_name":"General linear relations between different types of predictive complexity","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2033194803","doi":"https://doi.org/10.1016/s0304-3975(01)00039-1","mag":"2033194803"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00039-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00039-1","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/A5048818681","display_name":"Yuri Kalnishkan","orcid":"https://orcid.org/0000-0003-1134-8937"},"institutions":[{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]},{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Yuri Kalnishkan","raw_affiliation_strings":["Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK","University of London  ,  London ,  UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK","institution_ids":["https://openalex.org/I184558857"]},{"raw_affiliation_string":"University of London  ,  London ,  UK","institution_ids":["https://openalex.org/I124357947"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048818681"],"corresponding_institution_ids":["https://openalex.org/I124357947","https://openalex.org/I184558857"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.6977,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68248019,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"271","issue":"1-2","first_page":"181","last_page":"200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991000294685364,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9879999756813049,"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.8128887414932251},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7522820234298706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6575459241867065},{"id":"https://openalex.org/keywords/kolmogorov-structure-function","display_name":"Kolmogorov structure function","score":0.5925295948982239},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.573184072971344},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5707911849021912},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5611239075660706},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"Average-case complexity","score":0.5604593753814697},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5585151314735413},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.5314696431159973},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43729424476623535},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.43233346939086914},{"id":"https://openalex.org/keywords/asymptotic-computational-complexity","display_name":"Asymptotic computational complexity","score":0.4201425313949585},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.4194229245185852},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33899733424186707},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11865320801734924}],"concepts":[{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.8128887414932251},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7522820234298706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6575459241867065},{"id":"https://openalex.org/C15995199","wikidata":"https://www.wikidata.org/wiki/Q5805968","display_name":"Kolmogorov structure function","level":3,"score":0.5925295948982239},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.573184072971344},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5707911849021912},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5611239075660706},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.5604593753814697},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5585151314735413},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.5314696431159973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43729424476623535},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.43233346939086914},{"id":"https://openalex.org/C164215192","wikidata":"https://www.wikidata.org/wiki/Q13414364","display_name":"Asymptotic computational complexity","level":4,"score":0.4201425313949585},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.4194229245185852},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33899733424186707},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11865320801734924},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(01)00039-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00039-1","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6800000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1483114294","https://openalex.org/W1638203394","https://openalex.org/W1705752413","https://openalex.org/W1970483275","https://openalex.org/W1972887468","https://openalex.org/W1979675141","https://openalex.org/W1997404989","https://openalex.org/W2029308360","https://openalex.org/W2033906329","https://openalex.org/W2093825590","https://openalex.org/W2106658060","https://openalex.org/W2164331183","https://openalex.org/W2611627047","https://openalex.org/W3149261725","https://openalex.org/W4230960895","https://openalex.org/W4248175720"],"related_works":["https://openalex.org/W2374430960","https://openalex.org/W2081026687","https://openalex.org/W1512399864","https://openalex.org/W2327776271","https://openalex.org/W1548964214","https://openalex.org/W2372260410","https://openalex.org/W2035152936","https://openalex.org/W636594073","https://openalex.org/W2496940404","https://openalex.org/W2033194803"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}