On the complexity of hazard-free circuits

DOI10.1145/3188745.3188912zbMath1428.94117OpenAlexW2767780943MaRDI QIDQ5230345

Karteek Sreenivasaiah, Christoph Lenzen, Christian Ikenmeyer, Andrey Mokhov, Balagopal Komarath, Vladimir Lysikov

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://eprint.ncl.ac.uk/fulltext.aspx?url=260552/A42C0751-2F49-4FC4-A113-713C1C9C0F85.pdf&pub_id=260552

zbMATH Keywords

computational complexitymonotone circuitsBoolean circuitshazards

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (1)

On the complexity of detecting hazards

This page was built for publication: On the complexity of hazard-free circuits