ACM Symposium on Theory of Computing, STOC 2018

Article Details
Title: On the complexity of hazard-free circuits
Article URLs:
Alternative Article URLs:
Authors: Christian Ikenmeyer
  • Max-Planck-Institut für Informatik
Balagopal Komarath
  • Saarland University
Christoph Lenzen
  • Max-Planck-Institut für Informatik
Vladimir Lysikov
  • Saarland University
  • Cluster of Excellence MMCI
Andrey Mokhov
  • Newcastle University, School of Engineering
Karteek Sreenivasaiah
  • Indian Institute of Technology Hyderabad
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/IkenmeyerKLLMS18
Author Comments:

Discuss this paper and its artifacts below