{"id":"https://openalex.org/W2583016001","doi":"https://doi.org/10.1145/3055399.3055496","title":"Succinct hitting sets and barriers to proving algebraic circuits lower bounds","display_name":"Succinct hitting sets and barriers to proving algebraic circuits lower bounds","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2583016001","doi":"https://doi.org/10.1145/3055399.3055496","mag":"2583016001"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055496","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5017319217","display_name":"Michael A. Forbes","orcid":"https://orcid.org/0000-0002-2240-7245"},"institutions":[{"id":"https://openalex.org/I4210107338","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210107338"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael A. Forbes","raw_affiliation_strings":["Simons Institute for the Theory of Computing Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Simons Institute for the Theory of Computing Berkeley, USA","institution_ids":["https://openalex.org/I4210107338"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Amir Shpilka","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amir Shpilka","raw_affiliation_strings":["Tel Aviv University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073175433","display_name":"Ben Lee Volk","orcid":"https://orcid.org/0000-0002-7143-7280"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ben Lee Volk","raw_affiliation_strings":["Tel Aviv University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7484,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.960342,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"653","last_page":"664"},"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.9997000098228455,"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.9997000098228455,"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.996999979019165,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.996399998664856,"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/algebraic-number","display_name":"Algebraic number","score":0.703537106513977},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.6832457184791565},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6773508191108704},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5806980729103088},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5376220345497131},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5281983017921448},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5156489610671997},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5107800960540771},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5033923983573914},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.47622591257095337},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43768009543418884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32998204231262207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19601649045944214}],"concepts":[{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.703537106513977},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6832457184791565},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6773508191108704},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5806980729103088},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5376220345497131},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5281983017921448},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5156489610671997},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5107800960540771},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5033923983573914},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47622591257095337},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43768009543418884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32998204231262207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19601649045944214},{"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},{"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.1145/3055399.3055496","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055496","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2804299766","display_name":"AF:Small:Limitations on Algebraic Methods via Boolean Complexity Theory","funder_award_id":"1617580","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":84,"referenced_works":["https://openalex.org/W50958263","https://openalex.org/W1503731768","https://openalex.org/W1508701206","https://openalex.org/W1508771701","https://openalex.org/W1561337879","https://openalex.org/W1599026900","https://openalex.org/W1760203663","https://openalex.org/W1967348711","https://openalex.org/W1968245619","https://openalex.org/W1973342538","https://openalex.org/W1974331311","https://openalex.org/W1984477611","https://openalex.org/W1988938797","https://openalex.org/W1992071680","https://openalex.org/W1993138363","https://openalex.org/W1995511496","https://openalex.org/W1998853590","https://openalex.org/W2000108234","https://openalex.org/W2009994177","https://openalex.org/W2012476164","https://openalex.org/W2015880590","https://openalex.org/W2016576580","https://openalex.org/W2023541349","https://openalex.org/W2026036943","https://openalex.org/W2026944800","https://openalex.org/W2027044307","https://openalex.org/W2036656440","https://openalex.org/W2044399075","https://openalex.org/W2044997341","https://openalex.org/W2045924252","https://openalex.org/W2055240703","https://openalex.org/W2060270693","https://openalex.org/W2064885856","https://openalex.org/W2069546133","https://openalex.org/W2070678975","https://openalex.org/W2074207216","https://openalex.org/W2079910744","https://openalex.org/W2080132708","https://openalex.org/W2081256023","https://openalex.org/W2082002555","https://openalex.org/W2082647621","https://openalex.org/W2085012646","https://openalex.org/W2091564680","https://openalex.org/W2093103267","https://openalex.org/W2110206454","https://openalex.org/W2117362057","https://openalex.org/W2125151663","https://openalex.org/W2125495920","https://openalex.org/W2128510017","https://openalex.org/W2128644843","https://openalex.org/W2136589970","https://openalex.org/W2142326730","https://openalex.org/W2144560442","https://openalex.org/W2152772468","https://openalex.org/W2170831059","https://openalex.org/W2171403864","https://openalex.org/W2172394696","https://openalex.org/W2175296692","https://openalex.org/W2181660280","https://openalex.org/W2275340472","https://openalex.org/W2293988196","https://openalex.org/W2343516500","https://openalex.org/W2350173794","https://openalex.org/W2352054748","https://openalex.org/W2399980850","https://openalex.org/W2405068759","https://openalex.org/W2467589244","https://openalex.org/W2476975080","https://openalex.org/W2576114839","https://openalex.org/W2578305700","https://openalex.org/W2583016001","https://openalex.org/W2611339529","https://openalex.org/W2625490399","https://openalex.org/W2625637274","https://openalex.org/W2912080987","https://openalex.org/W2951995773","https://openalex.org/W2962908760","https://openalex.org/W2963534336","https://openalex.org/W3021486028","https://openalex.org/W3103519306","https://openalex.org/W3158515052","https://openalex.org/W4295910261","https://openalex.org/W4301050099","https://openalex.org/W6732393951"],"related_works":["https://openalex.org/W2150974517","https://openalex.org/W4390188610","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W2728195892","https://openalex.org/W1597080238","https://openalex.org/W3204916073","https://openalex.org/W2031906996","https://openalex.org/W2055594799","https://openalex.org/W1936629927"],"abstract_inverted_index":{"We":[0],"formalize":[1],"a":[2,57],"framework":[3],"of":[4,19,30],"algebraically":[5,31],"natural":[6,16,32],"lower":[7,26,33,38,62],"bounds":[8,34,63],"for":[9,23,64],"algebraic":[10,66,74,84],"circuits.":[11,85],"Just":[12],"as":[13,68],"with":[14],"the":[15,44],"proofs":[17],"notion":[18,29],"Razborov":[20],"and":[21],"Rudich":[22],"boolean":[24,45],"circuit":[25],"bounds,":[27],"our":[28],"captures":[35],"nearly":[36],"all":[37],"bound":[39],"techniques":[40],"known.":[41],"However,":[42],"unlike":[43],"setting,":[46],"there":[47,69],"has":[48],"been":[49],"no":[50],"concrete":[51],"evidence":[52],"demonstrating":[53],"that":[54],"this":[55],"is":[56,70],"barrier":[58],"to":[59,79],"obtaining":[60],"super-polynomial":[61],"general":[65],"circuits,":[67],"little":[71],"understanding":[72],"whether":[73],"circuits":[75],"are":[76],"expressive":[77],"enough":[78],"support":[80],"\"cryptography\"":[81],"secure":[82],"against":[83]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}