{"id":"https://openalex.org/W2170007444","doi":"https://doi.org/10.1007/978-3-642-02927-1_18","title":"Unconditional Lower Bounds against Advice","display_name":"Unconditional Lower Bounds against Advice","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2170007444","doi":"https://doi.org/10.1007/978-3-642-02927-1_18","mag":"2170007444"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02927-1_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02927-1_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/6058e875-35c7-4476-b7e6-48b6be318ccb","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083983355","display_name":"Harry Buhrman","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Harry Buhrman","raw_affiliation_strings":["CWI, Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075191567","display_name":"Lance Fortnow","orcid":"https://orcid.org/0000-0002-2020-1358"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lance Fortnow","raw_affiliation_strings":["Northwestern University, USA"],"affiliations":[{"raw_affiliation_string":"Northwestern University, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"last","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":false,"raw_author_name":"Rahul Santhanam","raw_affiliation_strings":["University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083983355"],"corresponding_institution_ids":["https://openalex.org/I1341640284"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3017,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.89808129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"195","last_page":"209"},"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.9994000196456909,"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.9994000196456909,"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.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/oracle","display_name":"Oracle","score":0.7902340888977051},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.754766583442688},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6486673951148987},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5974996089935303},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5666759610176086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5361267328262329},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49689510464668274},{"id":"https://openalex.org/keywords/current","display_name":"Current (fluid)","score":0.45055320858955383},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4297904372215271},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4212314188480377},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3759821057319641},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36499857902526855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30224183201789856},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08906242251396179}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7902340888977051},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.754766583442688},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6486673951148987},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5974996089935303},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5666759610176086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5361267328262329},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49689510464668274},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.45055320858955383},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4297904372215271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4212314188480377},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3759821057319641},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36499857902526855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30224183201789856},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08906242251396179},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","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},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-02927-1_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02927-1_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/96f851ee-cd90-48f1-82f2-17b8ead4ce02","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/unconditional-lower-bounds-against-advice(96f851ee-cd90-48f1-82f2-17b8ead4ce02).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Buhrman, H, Fortnow, L & Santhanam, R 2009, Unconditional lower bounds against advice. in S Albers, A Marchetti-Spaccamela, Y Matias, S Nikoletseas & W Thomas (eds), Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009 : proceedings. vol. I, Lecture Notes in Computer Science, vol. 5555, Berlin, pp. 195-209, 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Rhodes, Greece, 5/07/09. https://doi.org/10.1007/978-3-642-02927-1_18","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/6058e875-35c7-4476-b7e6-48b6be318ccb","is_oa":true,"landing_page_url":null,"pdf_url":"https://www.research.ed.ac.uk/en/publications/6058e875-35c7-4476-b7e6-48b6be318ccb","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.ed.ac.uk:publications/2fc09f38-f924-4b71-897e-932d56bda1b6","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/2fc09f38-f924-4b71-897e-932d56bda1b6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/96f851ee-cd90-48f1-82f2-17b8ead4ce02","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/unconditional-lower-bounds-against-advice(96f851ee-cd90-48f1-82f2-17b8ead4ce02).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Automata, Languages and Programming: 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009 : proceedings, I, 195 - 209","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:publications/6058e875-35c7-4476-b7e6-48b6be318ccb","is_oa":true,"landing_page_url":null,"pdf_url":"https://www.research.ed.ac.uk/en/publications/6058e875-35c7-4476-b7e6-48b6be318ccb","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2170007444.pdf"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1815441906","https://openalex.org/W1973874352","https://openalex.org/W1984477611","https://openalex.org/W1987444582","https://openalex.org/W1992055577","https://openalex.org/W1993138363","https://openalex.org/W1996834809","https://openalex.org/W1998918799","https://openalex.org/W2014343882","https://openalex.org/W2016610770","https://openalex.org/W2069864904","https://openalex.org/W2075449032","https://openalex.org/W2078924305","https://openalex.org/W2083039580","https://openalex.org/W2083237534","https://openalex.org/W2095233625","https://openalex.org/W2097206148","https://openalex.org/W2123852216","https://openalex.org/W2132265944","https://openalex.org/W2134409170","https://openalex.org/W2144345645","https://openalex.org/W2158747250","https://openalex.org/W2169453948","https://openalex.org/W2912080987","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W4393601209","https://openalex.org/W3090906284","https://openalex.org/W253876680","https://openalex.org/W4393803066","https://openalex.org/W1987931999","https://openalex.org/W4293797372","https://openalex.org/W4238052600","https://openalex.org/W4254639292","https://openalex.org/W3005176110","https://openalex.org/W4390575969"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}