{"id":"https://openalex.org/W2621027562","doi":"https://doi.org/10.1145/3349616","title":"New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems","display_name":"New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems","publication_year":2019,"publication_date":"2019-09-12","ids":{"openalex":"https://openalex.org/W2621027562","doi":"https://doi.org/10.1145/3349616","mag":"2621027562"},"language":"en","primary_location":{"id":"doi:10.1145/3349616","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3349616","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3349616","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3349616","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078734824","display_name":"Eric Allender","orcid":"https://orcid.org/0000-0002-0650-028X"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eric Allender","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA","Rutgers University; Piscataway NJ USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers University; Piscataway NJ USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062484134","display_name":"Shuichi Hirahara","orcid":"https://orcid.org/0000-0002-3101-446X"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shuichi Hirahara","raw_affiliation_strings":["National Institute of Informatics, Chiyoda-ku, Tokyo, Japan","National Institute of Informatics, Chiyoda-ku, , Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Chiyoda-ku, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"National Institute of Informatics, Chiyoda-ku, , Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078734824"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":0.8086,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7375574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"4","first_page":"1","last_page":"27"},"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.9873999953269958,"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.9873999953269958,"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/T11130","display_name":"Coding theory and cryptography","score":0.9787999987602234,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9758999943733215,"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/bounded-function","display_name":"Bounded function","score":0.6646308898925781},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6186726689338684},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6091797947883606},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5787676572799683},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.536247193813324},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5343263745307922},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5235297679901123},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5030061602592468},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4905978739261627},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.48853787779808044},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.36355000734329224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19258588552474976},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19216421246528625},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.09306901693344116}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6646308898925781},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6186726689338684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6091797947883606},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5787676572799683},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.536247193813324},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5343263745307922},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5235297679901123},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5030061602592468},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4905978739261627},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.48853787779808044},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.36355000734329224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19258588552474976},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19216421246528625},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.09306901693344116},{"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/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1145/3349616","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3349616","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3349616","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11643425530004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/acceptedManuscript/New-insights-on-the-non-hardness-of/991031549865004646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:example.org:rutgers-lib:55163","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401388","display_name":"Rutgers University Community Repository (Rutgers University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102322142","host_organization_name":"Rutgers, The State University of New Jersey","host_organization_lineage":["https://openalex.org/I102322142"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article, Refereed"},{"id":"pmh:oai:alma.01RUT_INST:11643410920004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/preprint/New-Insights-on-the-Non-Hardness-of/991031549990204646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"pmh:oai:drops-oai.dagstuhl.de:8063","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.54","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.mfcs.2017.54","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2017.54","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"doi:10.7282/t3-nk3n-fz56","is_oa":true,"landing_page_url":"https://doi.org/10.7282/t3-nk3n-fz56","pdf_url":null,"source":{"id":"https://openalex.org/S4306401388","display_name":"Rutgers University Community Repository (Rutgers University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102322142","host_organization_name":"Rutgers, The State University of New Jersey","host_organization_lineage":["https://openalex.org/I102322142"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.7282/t3m048jp","is_oa":true,"landing_page_url":"https://doi.org/10.7282/t3m048jp","pdf_url":null,"source":{"id":"https://openalex.org/S4306401388","display_name":"Rutgers University Community Repository (Rutgers University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102322142","host_organization_name":"Rutgers, The State University of New Jersey","host_organization_lineage":["https://openalex.org/I102322142"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:2621027562","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc24.html#AllenderH17","pdf_url":null,"source":{"id":"https://openalex.org/S4306509107","display_name":"Electron. Colloquium Comput. Complex.","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electron. Colloquium Comput. Complex.","raw_type":null},{"id":"mag:3127982096","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#AllenderH17","pdf_url":null,"source":{"id":"https://openalex.org/S4306420488","display_name":"Mathematical Foundations of Computer Science","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Mathematical Foundations of Computer Science","raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3349616","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3349616","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3349616","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2065896496","display_name":"EAGER: AF: New approaches to hardness for circuit minimization","funder_award_id":"1555409","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4048731509","display_name":null,"funder_award_id":"CCF-1514164","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4861343859","display_name":null,"funder_award_id":"JP16J06743","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5418018962","display_name":null,"funder_award_id":"CCF-1555409","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5863653337","display_name":null,"funder_award_id":"CCF-1555409, CCF-1514164","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7425067100","display_name":null,"funder_award_id":"1514164","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"},{"id":"https://openalex.org/F4320320698","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2621027562.pdf","grobid_xml":"https://content.openalex.org/works/W2621027562.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1496630551","https://openalex.org/W1966819396","https://openalex.org/W1974751157","https://openalex.org/W1989159237","https://openalex.org/W1997643965","https://openalex.org/W2004974518","https://openalex.org/W2015413218","https://openalex.org/W2015880590","https://openalex.org/W2021469124","https://openalex.org/W2021736779","https://openalex.org/W2028930979","https://openalex.org/W2045583484","https://openalex.org/W2046812405","https://openalex.org/W2051738174","https://openalex.org/W2052936500","https://openalex.org/W2058859323","https://openalex.org/W2070678975","https://openalex.org/W2081254453","https://openalex.org/W2083237534","https://openalex.org/W2105859078","https://openalex.org/W2108585502","https://openalex.org/W2117362057","https://openalex.org/W2127563879","https://openalex.org/W2158596367","https://openalex.org/W2158747250","https://openalex.org/W2402456376","https://openalex.org/W2608011726","https://openalex.org/W2610312456","https://openalex.org/W2736990046","https://openalex.org/W2787265165","https://openalex.org/W2884885487","https://openalex.org/W2912080987"],"related_works":["https://openalex.org/W2773570193","https://openalex.org/W2753256758","https://openalex.org/W2282170612","https://openalex.org/W2279489453","https://openalex.org/W2888250735","https://openalex.org/W3197104681","https://openalex.org/W3023658018","https://openalex.org/W3157102507","https://openalex.org/W2888575364","https://openalex.org/W2902479036","https://openalex.org/W1987681136","https://openalex.org/W1568724636","https://openalex.org/W3127071357","https://openalex.org/W3168614261","https://openalex.org/W2037022371","https://openalex.org/W2984191194","https://openalex.org/W2252183760","https://openalex.org/W2111385661","https://openalex.org/W2001663593","https://openalex.org/W2254028205"],"abstract_inverted_index":{"The":[0],"Minimum":[1],"Circuit":[2,182],"Size":[3],"Problem":[4],"(MCSP)":[5],"and":[6,146,244],"a":[7,51,104,107,191,199,207,225],"related":[8],"problem":[9,39],"(MKTP)":[10],"that":[11,95,124],"deal":[12],"with":[13],"time-bounded":[14,47],"Kolmogorov":[15,48],"complexity":[16,130,240],"are":[17,70,186],"prominent":[18],"candidates":[19],"for":[20,128,206,224,248],"NP-intermediate":[21,74,117],"status.":[22],"We":[23,121,161],"show":[24,94],"that,":[25],"under":[26,76,133,198],"very":[27],"modest":[28],"cryptographic":[29],"assumptions":[30],"(such":[31],"as":[32,155],"the":[33,38,42,63,71,77,97,100,129,234,239],"existence":[34,78],"of":[35,40,53,65,79,99,109,151,190,196,201,210,216,221,228,241],"one-way":[36,82],"functions),":[37],"approximating":[41,96],"minimum":[43],"circuit":[44],"size":[45,98,183],"(or":[46],"complexity)":[49],"within":[50,106],"factor":[52,108],"n":[54,110],"1":[55,111],"\u2212":[56,112],"o":[57,113],"(1)":[58,114],"is":[59,86,115,126,139,173,233],"indeed":[60],"NP-intermediate.":[61],"To":[62],"best":[64],"our":[66],"knowledge,":[67],"these":[68],"problems":[69,75],"first":[72,235],"natural":[73],"an":[80],"arbitrary":[81],"function.":[83],"Our":[84],"technique":[85],"quite":[87],"general;":[88],"we":[89],"use":[90],"it":[91],"also":[92,116,122],"to":[93,166,188],"largest":[101],"clique":[102],"in":[103,175],"graph":[105],"unless":[118],"NP\u2286":[119],"P/poly.":[120],"prove":[123],"MKTP":[125,147,172,194,197],"hard":[127],"class":[131,200,209,227],"DET":[132],"non-uniform":[134],"NC":[135,157],"0":[136,158,177,204],"reductions.":[137],"This":[138,232],"surprising,":[140],"since":[141],"prior":[142],"work":[143],"on":[144],"MCSP":[145,217,222,242,245],"had":[148],"highlighted":[149],"weaknesses":[150],"\u201clocal\u201d":[152],"reductions":[153],"such":[154],"\u2264":[156],"m":[159],".":[160,213,231,251],"exploit":[162],"this":[163],"local":[164],"reduction":[165],"obtain":[167],"several":[168],"new":[169],"consequences:":[170],"\u2014":[171,181,214],"not":[174],"AC":[176,203],"[":[178],"p":[179],"].":[180],"lower":[184],"bounds":[185],"equivalent":[187],"hardness":[189,220],"relativized":[192],"version":[193],"A":[195,212,218,223,230,243,246,250],"uniform":[202],"reductions,":[205],"significant":[208,226],"sets":[211,229],"Hardness":[215],"implies":[219],"result":[236],"directly":[237],"relating":[238],",":[247],"any":[249]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2017-06-09T00:00:00"}