On the Complexity of Hazard-free Circuits

The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is polynomially bounded while every hazard-free implementation is prov...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the ACM 2019-08, Vol.66 (4), p.1-20
Hauptverfasser:	Ikenmeyer, Christian, Komarath, Balagopal, Lenzen, Christoph, Lysikov, Vladimir, Mokhov, Andrey, Sreenivasaiah, Karteek
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Boolean Boolean algebra Boolean functions Circuit design Circuits Complexity Gates (circuits) Hazards Lower bounds Monotone functions Multiplication Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!