{"id":"https://openalex.org/W7170180642","doi":"https://doi.org/10.4230/lipics.ccc.2026.40","title":"ETH-Hardness of Learning Monotone Circuits and Approximating Their Size","display_name":"ETH-Hardness of Learning Monotone Circuits and Approximating Their Size","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170180642","doi":"https://doi.org/10.4230/lipics.ccc.2026.40"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.40","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.40","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.40","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009822741","display_name":"Bruno Pasqualotto Cavalar","orcid":"https://orcid.org/0000-0002-0458-8767"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Cavalar, Bruno","raw_affiliation_strings":["University of Oxford, UK"],"raw_orcid":"https://orcid.org/0000-0002-0458-8767","affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057666042","display_name":"Susanna F. de Rezende","orcid":"https://orcid.org/0000-0001-8923-1240"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"de Rezende, Susanna F.","raw_affiliation_strings":["Lund University, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-8923-1240","affiliations":[{"raw_affiliation_string":"Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143498877","display_name":"Matthew Gray","orcid":"https://orcid.org/0000-0003-4065-0158"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gray, Matthew","raw_affiliation_strings":["University of Oxford, UK"],"raw_orcid":"https://orcid.org/0000-0003-4065-0158","affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"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/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Santhanam, Rahul","raw_affiliation_strings":["University of Oxford, UK"],"raw_orcid":"https://orcid.org/0000-0002-8716-6091","affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.9138000011444092},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5625},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5230000019073486},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.49140000343322754},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4812999963760376},{"id":"https://openalex.org/keywords/strongly-monotone","display_name":"Strongly monotone","score":0.476500004529953},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.4537000060081482}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.9138000011444092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7526999711990356},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5320000052452087},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5230000019073486},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.49140000343322754},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C12715386","wikidata":"https://www.wikidata.org/wiki/Q7624691","display_name":"Strongly monotone","level":3,"score":0.476500004529953},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.4537000060081482},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.43540000915527344},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.42239999771118164},{"id":"https://openalex.org/C82520618","wikidata":"https://www.wikidata.org/wiki/Q3527015","display_name":"Bernstein's theorem on monotone functions","level":4,"score":0.39430001378059387},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.359499990940094},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33320000767707825},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.31709998846054077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29319998621940613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29190000891685486},{"id":"https://openalex.org/C2778199601","wikidata":"https://www.wikidata.org/wiki/Q5165476","display_name":"Continuous function (set theory)","level":3,"score":0.2808000147342682},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.25949999690055847},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.40","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.40","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.40","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.40","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"show":[1],"the":[2,17,54,75,124],"following":[3],"hardness":[4,117,136],"results":[5,101],"for":[6,47,59],"monotone":[7,12,29,41,77,82,119],"learning":[8],"and":[9,35,113,129,132],"approximation":[10],"of":[11,43,80,88,108,118,127,137],"circuit":[13,78],"size:":[14],"1)":[15],"Under":[16,53],"Randomised":[18,55],"Exponential-Time":[19,56],"Hypothesis":[20,57],"(rETH),":[21,58],"it":[22],"requires":[23,97],"time":[24,98],"n^{\u03a9(log":[25],"n)}":[26],"to":[27,116],"PAC-learn":[28],"formulas":[30],"with":[31,85],"n":[32,39],"input":[33],"bits":[34],"size":[36,44,79],"s(n)":[37],"=":[38],"by":[40,104,121],"circuits":[42],"n^{(log":[45],"n)^{1-\u03b5}},":[46],"every":[48],"\u03b5":[49],">":[50,62],"0.":[51],"2)":[52],"any":[60],"\u03b4":[61],"0,":[63],"there":[64],"is":[65],"a":[66,81,86,105],"polynomially":[67],"bounded":[68],"function":[69,83],"m":[70],"such":[71],"that":[72],"m^{1-\u03b4}-multiplicatively":[73],"approximating":[74],"minimum":[76],"consistent":[84],"sequence":[87],"m(n)":[89],"labelled":[90],"examples":[91],"{(x_i,":[92],"b_i)}":[93],"over":[94],"n-bit":[95],"inputs":[96],"m^{\u03a9(log(m))}.":[99],"Our":[100],"are":[102],"shown":[103],"novel":[106],"application":[107],"lifting":[109],"arguments":[110],"in":[111],"proof":[112],"communication":[114],"complexity":[115],"learning,":[120],"building":[122],"on":[123,135],"seminal":[125],"result":[126],"Atserias":[128],"M\u00fcller":[130],"[Atserias":[131],"M\u00fcller,":[133],"2020]":[134],"automating":[138],"Resolution":[139],"proofs.":[140]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}