{"id":"https://openalex.org/W7110113070","doi":"https://doi.org/10.4230/lipics.icalp.2025.115","title":"On the Complexity of Hazard-Free Formulas","display_name":"On the Complexity of Hazard-Free Formulas","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110113070","doi":"https://doi.org/10.4230/lipics.icalp.2025.115"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23492","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.115","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.115/LIPIcs.ICALP.2025.115.pdf","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":null,"raw_type":"InProceedings"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.115/LIPIcs.ICALP.2025.115.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"London Arazi, Leah","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":"London Arazi, Leah","raw_affiliation_strings":["School of Computer Science, Tel Aviv University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":null,"display_name":"Shpilka, Amir","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":"Shpilka, Amir","raw_affiliation_strings":["School of Computer Science, Tel Aviv University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57194267,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6840000152587891,"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.6840000152587891,"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.07720000296831131,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.055399999022483826,"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/boolean-function","display_name":"Boolean function","score":0.8367999792098999},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.7035999894142151},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.6448000073432922},{"id":"https://openalex.org/keywords/implicant","display_name":"Implicant","score":0.6015999913215637},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5613999962806702},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5206999778747559},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4936999976634979},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.478300005197525},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4717000126838684},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4433000087738037}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.8367999792098999},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7893000245094299},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.7035999894142151},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.6448000073432922},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6108999848365784},{"id":"https://openalex.org/C102487863","wikidata":"https://www.wikidata.org/wiki/Q1291626","display_name":"Implicant","level":4,"score":0.6015999913215637},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5613999962806702},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5206999778747559},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4936999976634979},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48069998621940613},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.478300005197525},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4717000126838684},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4433000087738037},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.39910000562667847},{"id":"https://openalex.org/C6435147","wikidata":"https://www.wikidata.org/wiki/Q5156627","display_name":"Complexity index","level":3,"score":0.3977999985218048},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.396699994802475},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.36559998989105225},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.36079999804496765},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3544999957084656},{"id":"https://openalex.org/C81518389","wikidata":"https://www.wikidata.org/wiki/Q5156447","display_name":"Complete Boolean algebra","level":5,"score":0.34630000591278076},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.3375000059604645},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C3746008","wikidata":"https://www.wikidata.org/wiki/Q981351","display_name":"Symmetric function","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.2912999987602234},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.2904999852180481},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C13929819","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Random function","level":3,"score":0.27410000562667847},{"id":"https://openalex.org/C105355099","wikidata":"https://www.wikidata.org/wiki/Q720931","display_name":"One-way function","level":3,"score":0.2667999863624573},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.26440000534057617},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23492","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.115","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.115/LIPIcs.ICALP.2025.115.pdf","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":null,"raw_type":"InProceedings"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23492","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.115","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.115/LIPIcs.ICALP.2025.115.pdf","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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110113070.pdf","grobid_xml":"https://content.openalex.org/works/W7110113070.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,18,24,29,32,37,43,48,66,94,103,111,117,128,133,153,172,188,199,208,220,235,253,267,272,276,281,285,289],"hazard-free":[4,33,67,118,130,200,221,236,268],"formula":[5,26,34,68,119,131,222,269],"complexity":[6,27,35,69,105,120,201,210,223],"of":[7,28,36,51,70,97,110,121,145,155,158,171,202,207,211,214,224,227,244,271,275],"Boolean":[8,20,74,98,161,228],"functions.":[9],"Our":[10,61],"first":[11,149],"result":[12,63,233,243,260],"shows":[13],"that":[14,65,109,238,258],"unate":[15],"functions":[16,21,45,229],"are":[17,42],"only":[19,44],"for":[22,46,132],"which":[23,47,193],"monotone":[25,209,254],"hazard-derivative":[30,49,189,290],"equals":[31],"function":[38,75,113,124,162,204,279,283],"itself.":[39],"Consequently,":[40],"they":[41],"approach":[50],"Ikenmeyer":[52],"et":[53],"al.":[54],"(J.":[55],"ACM,":[56],"2019)":[57],"yields":[58],"optimal":[59,129],"bounds.":[60],"second":[62,176],"proves":[64],"a":[71,122,159,169,178,184,203,212,232,242,262],"uniformly":[72],"random":[73,123,160],"is":[76,106,125,150,239],"at":[77],"most":[78],"2^{(1+o(1))n}.":[79],"Prior":[80],"to":[81,167,187,241],"this,":[82],"no":[83],"better":[84],"upper":[85,196],"bound":[86,166,191,197,265,286],"than":[87,127,284],"O(3\u207f)":[88],"was":[89],"known.":[90],"Notably,":[91],"unlike":[92],"in":[93,139,205,234,252],"general":[95],"case":[96],"circuits":[99],"and":[100,163,180,230,247],"formulas,":[101],"where":[102],"typical":[104],"derived":[107],"from":[108],"multiplexer":[112,134,282],"with":[114,280],"n-bit":[115],"selector,":[116],"smaller":[126],"by":[135],"an":[136,195],"exponential":[137],"factor":[138],"n.":[140],"We":[141,256],"provide":[142],"two":[143],"proofs":[144],"this":[146,165],"fact.":[147],"The":[148,175],"direct,":[151],"bounding":[152],"number":[154],"prime":[156],"implicants":[157],"using":[164],"construct":[168],"DNF":[170],"claimed":[173],"size.":[174],"introduces":[177],"new":[179],"independently":[181],"interesting":[182],"result:":[183],"weak":[185],"converse":[186],"lower":[190,264],"method,":[192],"gives":[194],"on":[198,266],"terms":[206],"subset":[213],"its":[215],"hazard-derivatives.":[216],"Additionally,":[217],"we":[218],"explore":[219],"block":[225,273],"composition":[226,274],"obtain":[231],"setting":[237],"analogous":[240],"Karchmer,":[245],"Raz,":[246],"Wigderson":[248],"(Computational":[249],"Complexity,":[250],"1995)":[251],"setting.":[255],"show":[257],"our":[259],"implies":[261],"stronger":[263],"depth":[270],"set":[277],"covering":[278],"obtained":[287],"via":[288],"method.":[291]},"counts_by_year":[],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-12-08T00:00:00"}