{"id":"https://openalex.org/W2952128268","doi":"https://doi.org/10.1145/3320123","title":"On the Complexity of Hazard-free Circuits","display_name":"On the Complexity of Hazard-free Circuits","publication_year":2019,"publication_date":"2019-08-23","ids":{"openalex":"https://openalex.org/W2952128268","doi":"https://doi.org/10.1145/3320123","mag":"2952128268"},"language":"en","primary_location":{"id":"doi:10.1145/3320123","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3320123","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3320123","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3320123","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Christian Ikenmeyer","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Ikenmeyer","raw_affiliation_strings":["Max Planck Institute for Software Systems, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Balagopal Komarath","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Balagopal Komarath","raw_affiliation_strings":["Saarland University, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Christoph Lenzen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Vladimir Lysikov","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vladimir Lysikov","raw_affiliation_strings":["Saarland University, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Andrey Mokhov","orcid":null},"institutions":[{"id":"https://openalex.org/I84884186","display_name":"Newcastle University","ror":"https://ror.org/01kj2bm70","country_code":"GB","type":"education","lineage":["https://openalex.org/I84884186"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrey Mokhov","raw_affiliation_strings":["Newcastle University, Newcastle upon Tyne, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Newcastle University, Newcastle upon Tyne, United Kingdom","institution_ids":["https://openalex.org/I84884186"]}]},{"author_position":"last","author":{"id":null,"display_name":"Karteek Sreenivasaiah","orcid":null},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Karteek Sreenivasaiah","raw_affiliation_strings":["Indian Institute of Technology Hyderabad, , Hyderabad, Telangana State, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Hyderabad, , Hyderabad, Telangana State, India","institution_ids":["https://openalex.org/I65181880"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1776,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.51989587,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"66","issue":"4","first_page":"1","last_page":"20"},"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.8248000144958496,"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.8248000144958496,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.048700001090765,"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/T10142","display_name":"Formal Methods in Verification","score":0.02539999969303608,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.8476999998092651},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.7677000164985657},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.6704999804496765},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6085000038146973},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6001999974250793},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5336999893188477},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5178999900817871},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4925999939441681},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4607999920845032},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.44620001316070557}],"concepts":[{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.8476999998092651},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.7677000164985657},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.6704999804496765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6496999859809875},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6085000038146973},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6001999974250793},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5336999893188477},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5267000198364258},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5178999900817871},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4925999939441681},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4607999920845032},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.44620001316070557},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44040000438690186},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.4343000054359436},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.4287000000476837},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C163561899","wikidata":"https://www.wikidata.org/wiki/Q1994977","display_name":"Logical matrix","level":3,"score":0.3797000050544739},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.37790000438690186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37209999561309814},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.3458999991416931},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.32670000195503235},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.3248000144958496},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.3221000134944916},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.3190999925136566},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30469998717308044},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.3019999861717224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30140000581741333},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C155920423","wikidata":"https://www.wikidata.org/wiki/Q4791120","display_name":"Arithmetic circuit complexity","level":3,"score":0.28540000319480896},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2700999975204468},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.26409998536109924},{"id":"https://openalex.org/C139002025","wikidata":"https://www.wikidata.org/wiki/Q3001212","display_name":"Lift (data mining)","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.2540999948978424},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.2529999911785126}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3320123","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3320123","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3320123","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1711.01904","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.01904","pdf_url":"https://arxiv.org/pdf/1711.01904","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3320123","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3320123","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3320123","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3240121495","display_name":null,"funder_award_id":"716562","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G5248561189","display_name":"Event-based parallel computing - partially ordered event-triggered systems (POETS)","funder_award_id":"EP/N031768/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6143952702","display_name":null,"funder_award_id":"EP/L025507/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G732396245","display_name":null,"funder_award_id":"EP/N023641/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7493804148","display_name":null,"funder_award_id":"EP/N031768/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7989424694","display_name":null,"funder_award_id":"EP/J008133/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2952128268.pdf","grobid_xml":"https://content.openalex.org/works/W2952128268.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1966278576","https://openalex.org/W1973342538","https://openalex.org/W1983448992","https://openalex.org/W1992277774","https://openalex.org/W2012476164","https://openalex.org/W2015950107","https://openalex.org/W2019184769","https://openalex.org/W2033176194","https://openalex.org/W2035476608","https://openalex.org/W2036869460","https://openalex.org/W2045260280","https://openalex.org/W2049238398","https://openalex.org/W2082035816","https://openalex.org/W2089119058","https://openalex.org/W2090738336","https://openalex.org/W2108726739","https://openalex.org/W2120248756","https://openalex.org/W2120688461","https://openalex.org/W2132283882","https://openalex.org/W2152772468","https://openalex.org/W2167849054","https://openalex.org/W2249739104","https://openalex.org/W2330503368","https://openalex.org/W2767780943","https://openalex.org/W2963331517","https://openalex.org/W4237763351"],"related_works":[],"abstract_inverted_index":{"The":[0,59],"problem":[1,16],"of":[2,28,42,68,89,163,193],"constructing":[3],"hazard-free":[4,38,50,114,128,152],"Boolean":[5,69,97,147],"circuits":[6,173],"dates":[7],"back":[8],"to":[9,92,108,125,143],"the":[10,26,49,113,122,161,166,175,191],"1940s":[11],"and":[12],"is":[13,33,40,85],"an":[14,182],"important":[15],"in":[17,160,174],"circuit":[18,31,148,153],"design.":[19],"Our":[20],"main":[21,137],"lower-bound":[22],"result":[23],"unconditionally":[24],"shows":[25],"existence":[27],"functions":[29],"whose":[30],"complexity":[32,51,84,91,105,129],"polynomially":[34,157],"bounded":[35],"while":[36],"every":[37,65],"implementation":[39,67],"provably":[41],"exponential":[43,127,183],"size.":[44],"Previous":[45],"lower":[46,106,110,130],"bounds":[47,107,111,131],"on":[48,112],"were":[52],"only":[53,155],"valid":[54],"for":[55,132],"depth":[56],"2":[57],"circuits.":[58],"same":[60],"proof":[61],"method":[62,169],"yields":[63],"that":[64],"subcubic":[66],"matrix":[70],"multiplication":[71],"must":[72],"have":[73],"hazards.":[74],"These":[75],"results":[76],"follow":[77],"from":[78,121],"a":[79,86,146,150,156,186],"crucial":[80],"structural":[81],"insight:":[82],"Hazard-free":[83],"natural":[87],"generalization":[88],"monotone":[90,104,123],"all":[93],"(not":[94],"necessarily":[95],"monotone)":[96],"functions.":[98,134],"Thus,":[99],"we":[100,140,189],"can":[101],"apply":[102],"known":[103,168],"find":[109],"complexity.":[115],"We":[116],"also":[117],"lift":[118],"these":[119],"methods":[120],"setting":[124],"prove":[126],"non-monotone":[133],"As":[135,185],"our":[136,179],"upper-bound":[138],"result,":[139,188],"show":[141],"how":[142],"efficiently":[144],"convert":[145],"into":[149],"bounded-bit":[151],"with":[154],"large":[158,172],"blow-up":[159],"number":[162],"gates.":[164],"Previously,":[165],"best":[167],"yielded":[170],"exponentially":[171],"worst":[176],"case,":[177],"so":[178],"algorithm":[180],"gives":[181],"improvement.":[184],"side":[187],"establish":[190],"NP-completeness":[192],"several":[194],"hazard":[195],"detection":[196],"problems.":[197]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2019-06-27T00:00:00"}