On the Complexity of Hazard-free Circuits

DOI10.1145/3320123zbMath1473.94170arXiv1711.01904OpenAlexW3122015429WikidataQ127336541 ScholiaQ127336541MaRDI QIDQ5215454

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

Publication date: 11 February 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.01904

zbMATH Keywords

computational complexitymonotone circuitsBoolean circuitshazards

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (1)

Notes on Hazard-Free Circuits

This page was built for publication: On the Complexity of Hazard-free Circuits