{"id":"https://openalex.org/W200600406","doi":"https://doi.org/10.1007/s00224-015-9655-z","title":"Information Lower Bounds via Self-Reducibility","display_name":"Information Lower Bounds via Self-Reducibility","publication_year":2015,"publication_date":"2015-09-24","ids":{"openalex":"https://openalex.org/W200600406","doi":"https://doi.org/10.1007/s00224-015-9655-z","mag":"200600406"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-015-9655-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-015-9655-z","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/A5042816355","display_name":"Mark Braverman","orcid":"https://orcid.org/0000-0003-1276-6081"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mark Braverman","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","[Department of Computer Science, Princeton University, Princeton, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"[Department of Computer Science, Princeton University, Princeton, USA]","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027551258","display_name":"Ankit Garg","orcid":"https://orcid.org/0000-0002-3343-0061"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ankit Garg","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","[Department of Computer Science, Princeton University, Princeton, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"[Department of Computer Science, Princeton University, Princeton, USA]","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027465905","display_name":"Denis Pankratov","orcid":"https://orcid.org/0000-0001-6387-6235"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Denis Pankratov","raw_affiliation_strings":["Department of Computer Science, University of Chicago, Chicago, IL, USA","[Department of Computer Science, University of Chicago, Chicago, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"[Department of Computer Science, University of Chicago, Chicago, USA]","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055582428","display_name":"Omri Weinstein","orcid":"https://orcid.org/0000-0002-9357-2299"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Omri Weinstein","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","[Department of Computer Science, Princeton University, Princeton, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"[Department of Computer Science, Princeton University, Princeton, USA]","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5042816355"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.8189,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.84843211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"59","issue":"2","first_page":"377","last_page":"396"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9984999895095825,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7347439527511597},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7134056687355042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.600548505783081},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5687753558158875},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5675759315490723},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5461897850036621},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5355883240699768},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4843215048313141},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4783306121826172},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4571911692619324},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4443841576576233},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.4124143719673157},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.330264687538147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23102682828903198}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7347439527511597},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7134056687355042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.600548505783081},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5687753558158875},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5675759315490723},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5461897850036621},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5355883240699768},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4843215048313141},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4783306121826172},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4571911692619324},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4443841576576233},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.4124143719673157},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.330264687538147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23102682828903198},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-015-9655-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-015-9655-z","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1979790324","https://openalex.org/W1984126159","https://openalex.org/W1992371956","https://openalex.org/W1995875735","https://openalex.org/W2002501531","https://openalex.org/W2002917701","https://openalex.org/W2029905190","https://openalex.org/W2060108852","https://openalex.org/W2068871408","https://openalex.org/W2078825942","https://openalex.org/W2082224527","https://openalex.org/W2086467753","https://openalex.org/W2091039687","https://openalex.org/W2104886711","https://openalex.org/W2107917944","https://openalex.org/W2114607430","https://openalex.org/W2114912439","https://openalex.org/W2123346469","https://openalex.org/W2151303208","https://openalex.org/W2340787257","https://openalex.org/W2397696965","https://openalex.org/W2398731595","https://openalex.org/W2407499394","https://openalex.org/W2963378100","https://openalex.org/W2993383518","https://openalex.org/W3104935792","https://openalex.org/W4210551624"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W3037084761","https://openalex.org/W2243645005","https://openalex.org/W4387560420","https://openalex.org/W1984126159","https://openalex.org/W2403157397"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}