{"id":"https://openalex.org/W2035122794","doi":"https://doi.org/10.1007/s00224-011-9368-x","title":"The Complexity of Explicit Constructions","display_name":"The Complexity of Explicit Constructions","publication_year":2011,"publication_date":"2011-11-17","ids":{"openalex":"https://openalex.org/W2035122794","doi":"https://doi.org/10.1007/s00224-011-9368-x","mag":"2035122794"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-011-9368-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-011-9368-x","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","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/A5085864294","display_name":"Rahul Santhanam","orcid":"https://orcid.org/0000-0002-8716-6091"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Rahul Santhanam","raw_affiliation_strings":["University of Edinburgh, Edinburgh, UK","University of Edinburgh, Edinburgh , UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh, Edinburgh , UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085864294"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3253,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60200583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"51","issue":"3","first_page":"297","last_page":"312"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.633989155292511},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.5406938791275024},{"id":"https://openalex.org/keywords/extremal-combinatorics","display_name":"Extremal combinatorics","score":0.5199940800666809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48978614807128906},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4874684810638428},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4599129557609558},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4588310420513153},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.41760802268981934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40092894434928894},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3655858635902405},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3337860703468323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32263457775115967},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1802566945552826},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1581859290599823},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.07870221138000488}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.633989155292511},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.5406938791275024},{"id":"https://openalex.org/C549619432","wikidata":"https://www.wikidata.org/wiki/Q5422299","display_name":"Extremal combinatorics","level":2,"score":0.5199940800666809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48978614807128906},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4874684810638428},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4599129557609558},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4588310420513153},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.41760802268981934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40092894434928894},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3655858635902405},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3337860703468323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32263457775115967},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1802566945552826},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1581859290599823},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.07870221138000488},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-011-9368-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-011-9368-x","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W987035227","https://openalex.org/W1527197079","https://openalex.org/W1530008367","https://openalex.org/W1569871753","https://openalex.org/W1638203394","https://openalex.org/W1966819396","https://openalex.org/W1968864043","https://openalex.org/W1998918799","https://openalex.org/W2010601719","https://openalex.org/W2016984055","https://openalex.org/W2021736779","https://openalex.org/W2054496431","https://openalex.org/W2061106457","https://openalex.org/W2062307640","https://openalex.org/W2064197162","https://openalex.org/W2068871408","https://openalex.org/W2083237534","https://openalex.org/W2135963330","https://openalex.org/W2137442467","https://openalex.org/W2164284862","https://openalex.org/W2164987725","https://openalex.org/W2569189913","https://openalex.org/W2595959570","https://openalex.org/W2778477491","https://openalex.org/W2912080987","https://openalex.org/W3003623942","https://openalex.org/W3150645827","https://openalex.org/W4214936872","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W2935028240","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W108605771","https://openalex.org/W2097465621","https://openalex.org/W2148482302","https://openalex.org/W2188379963","https://openalex.org/W1964609106","https://openalex.org/W1496519673","https://openalex.org/W4382582986"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}