{"id":"https://openalex.org/W1968180501","doi":"https://doi.org/10.1016/s0304-3975(01)00029-9","title":"Comparison between the complexity of a function and the complexity of its graph","display_name":"Comparison between the complexity of a function and the complexity of its graph","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1968180501","doi":"https://doi.org/10.1016/s0304-3975(01)00029-9","mag":"1968180501"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00029-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00029-9","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/A5102931766","display_name":"Bruno Durand","orcid":"https://orcid.org/0000-0003-3777-7377"},"institutions":[{"id":"https://openalex.org/I4210116669","display_name":"Ch\u00e2teau Gombert","ror":"https://ror.org/02kspbq18","country_code":"FR","type":"other","lineage":["https://openalex.org/I4210116669"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Bruno Durand","raw_affiliation_strings":["CMI - LIM, Technop\u00f4le de Ch\u00e2teau-Gombert, 39, rue Joliot-Curie, 13453 Marseille Cedex 13, France","CMI-LIM, Marseille, France#TAB#"],"affiliations":[{"raw_affiliation_string":"CMI - LIM, Technop\u00f4le de Ch\u00e2teau-Gombert, 39, rue Joliot-Curie, 13453 Marseille Cedex 13, France","institution_ids":["https://openalex.org/I4210116669"]},{"raw_affiliation_string":"CMI-LIM, Marseille, France#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035207715","display_name":"Sylvain Porrot","orcid":null},"institutions":[{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sylvain Porrot","raw_affiliation_strings":["LAIL and LIFL, B\u00e2t. P2, Universit\u00e9 des Sciences et Technologies de Lille, 59655 Villeneuve d'Ascq Cedex, France","Univ. des Sciences et Technologies de Lille, Lilleneuve d'Ascq, France#TAB#"],"affiliations":[{"raw_affiliation_string":"LAIL and LIFL, B\u00e2t. P2, Universit\u00e9 des Sciences et Technologies de Lille, 59655 Villeneuve d'Ascq Cedex, France","institution_ids":[]},{"raw_affiliation_string":"Univ. des Sciences et Technologies de Lille, Lilleneuve d'Ascq, France#TAB#","institution_ids":["https://openalex.org/I2279609970"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102931766"],"corresponding_institution_ids":["https://openalex.org/I4210116669"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.3489,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.54798615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"271","issue":"1-2","first_page":"37","last_page":"46"},"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/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9602000117301941,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9503999948501587,"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/mathematics","display_name":"Mathematics","score":0.6273521184921265},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5785367488861084},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.576850414276123},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5058119297027588},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4988524913787842},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.4439735412597656},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"Average-case complexity","score":0.4352729320526123},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4236762225627899},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41449007391929626},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4135143756866455},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40421366691589355},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38265228271484375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3033497631549835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28684183955192566}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6273521184921265},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5785367488861084},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.576850414276123},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5058119297027588},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4988524913787842},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.4439735412597656},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.4352729320526123},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4236762225627899},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41449007391929626},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4135143756866455},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40421366691589355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38265228271484375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3033497631549835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28684183955192566},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(01)00029-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00029-9","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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1549564104","https://openalex.org/W1578773715","https://openalex.org/W1598664776","https://openalex.org/W1638203394","https://openalex.org/W1976714922","https://openalex.org/W2026318097","https://openalex.org/W2029308360","https://openalex.org/W2500491642","https://openalex.org/W2571335838","https://openalex.org/W4230960895"],"related_works":["https://openalex.org/W2327776271","https://openalex.org/W2374430960","https://openalex.org/W2099977515","https://openalex.org/W2041069649","https://openalex.org/W1548964214","https://openalex.org/W2047754121","https://openalex.org/W342214647","https://openalex.org/W92019728","https://openalex.org/W981500437","https://openalex.org/W2105972598"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}