Christian Ikenmeyer
Andrey Mokhov
Skip Abstract Section
Abstract
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 provably of exponential size. Previous lower bounds on the hazard-free complexity were only valid for depth 2 circuits. The same proof method yields that every subcubic implementation of Boolean matrix multiplication must have hazards.
These results follow from a crucial structural insight: Hazard-free complexity is a natural generalization of monotone complexity to all (not necessarily monotone) Boolean functions. Thus, we can apply known monotone complexity lower bounds to find lower bounds on the hazard-free complexity. We also lift these methods from the monotone setting to prove exponential hazard-free complexity lower bounds for non-monotone functions.
As our main upper-bound result, we show how to efficiently convert a Boolean circuit into a bounded-bit hazard-free circuit with only a polynomially large blow-up in the number of gates. Previously, the best known method yielded exponentially large circuits in the worst case, so our algorithm gives an exponential improvement.
As a side result, we establish the NP-completeness of several hazard detection problems.
- Miklos Ajtai and Yuri Gurevich. 1987. Monotone versus positive. J. ACM 34, 4 (Oct. 1987), 1004--1015. Google Scholar
Digital Library
- Noga Alon and Ravi B. Boppana. 1987. The monotone circuit complexity of Boolean functions. Combinatorica 7, 1 (1987), 1--22. Google ScholarDigital Library
- Walter Baur and Volker Strassen. 1983. The complexity of partial derivatives. Theor. Comput. Sci. 22 (1983), 317--330.Google ScholarCross Ref
- Norbert Blum. 1985. An Ω (n<sup>4/3</sup>) lower bound on the monotone network complexity of the nth degree convolution. Theoretical Computer Science 36, Supplement C (1985), 59--69.Google ScholarCross Ref
- J. Brzozowski, Z. Esik, and Y. Iland. 2001. Algebras for hazard detection. In Proceedings of the 31st International Symposium on Multiple-Valued Logic. Google ScholarDigital Library
- J. A. Brzozowski. 1999. Some applications of ternary algebras. Publicationes Mathematicae (Debrecen) 54, Supplement (1999), 583--599.Google Scholar
- Janusz A. Brzozowski and Carl-Johan H. Seger. 1995. Asynchronous Circuits. Springer, New York.Google Scholar
- H. Martin Bücker and George F. Corliss. 2006. A bibliography of automatic differentiation. In Automatic Differentiation: Applications, Theory, and Implementations, Martin Bücker, George Corliss, Uwe Naumann, Paul Hovland, and Boyana Norris (Eds.). Springer-Verlag, Berlin, 321--322.Google Scholar
- Samuel H. Caldwell. 1958. Switching Circuits and Logical Design. John Wiley 8 Sons.Google Scholar
- Ashok K. Chandra and George Markowsky. 1978. On the number of prime implicants. Discrete Math. 24, 1 (1978), 7--11. Google ScholarDigital Library
- Marc Davio, Jean-Pierre Deschamps, and André Thaysé. 1978. Discrete and Switching Functions. McGraw-Hill.Google Scholar
- A. Martín del Rey, G. Rodríguez Sánchez, and A. de la Villa Cuenca. 2012. On the Boolean partial derivatives and their composition. Appl. Math. Lett. 25, 4 (2012), 739--744.Google ScholarCross Ref
- E. B. Eichelberger. 1965. Hazard detection in combinational and sequential switching circuits. IBM J. Res. Dev. 9, 2 (March 1965), 90--99. Google ScholarDigital Library
- Herbert B. Enderton. 2001. A Mathematical Introduction to Logic (2nd ed.). Academic Press.Google Scholar
- Stephan Friedrichs. 2017. Metastability-containing circuits, parallel distance problems, and terrain guarding. Ph.D. Dissertation. Universität des Saarlandes, Postfach 151141, 66041 Saarbrücken. http://scidok.sulb.uni-saarland.de/volltexte/2017/6966Google Scholar
- Stephan Friedrichs, Matthias Függer, and Christoph Lenzen. 2018. Metastability-containing circuits. IEEE Trans. Comput. (2018). Retrieved from https://arxiv.org/abs/1606.06570.Google ScholarCross Ref
- M. Goto. 1948. Application of three-valued logic to construct the theory of relay networks (in Japanese) 三値論理学の継電器回路網理論への應用 . Proceedings of the Joint Meeting IEE, IECE, and I. of Illum. E. of Japan, 電気三学会東京支部連合大会講演要旨. 昭和 22 · 23年 (1948), 31--32.Google Scholar
- M. Goto. 1949. Application of logical mathematics to the theory of relay networks (in Japanese). J. Inst. Elec. Eng. Japan 64, 726 (1949), 125--130.Google Scholar
- Michelangelo Grigni and Michael Sipser. 1992. Monotone complexity. In Proceedings of the London Mathematical Society Symposium on Boolean Function Complexity. Cambridge University Press, New York, NY, 57--75. http://dl.acm.org/citation.cfm?id=167687.167706 Google ScholarDigital Library
- W. Hu, J. Oberg, A. Irturk, M. Tiwari, T. Sherwood, D. Mu, and R. Kastner. 2012. On the complexity of generating gate level information flow tracking logic. IEEE Trans. Info. Forensics Secur. 7, 3 (June 2012), 1067--1080. Google ScholarDigital Library
- David A. Huffman. 1957. The design and use of hazard-free switching networks. J. ACM 4, 1 (Jan. 1957), 47--62. Google ScholarDigital Library
- Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, and Karteek Sreenivasaiah. 2018. On the complexity of hazard-free circuits. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC’18). ACM, New York, NY, 878--889. Google ScholarDigital Library
- Stasys Jukna. 2012. Boolean Function Complexity—Advances and Frontiers. Algorithms and combinatorics, Vol. 27. Springer. Google ScholarDigital Library
- Stephen Cole Kleene. 1938. On notation for ordinal numbers. J. Symbol. Logic 3, 4 (1938), 150--155. http://www.jstor.org/stable/2267778Google ScholarCross Ref
- Stephen Cole Kleene. 1952. Introduction to Metamathematics. North Holland.Google Scholar
- Stephan Körner. 1966. Experience and Theory : An Essay in the Philosophy of Science. Routledge 8 Kegan Paul, London.Google Scholar
- François Le Gall. 2014. Powers of tensors and fast matrix multiplication. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC’14). ACM, New York, NY, 296--303. Google ScholarDigital Library
- Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. 2011. Lower bounds based on the exponential time hypothesis. Bull. EATCS 105 (2011), 41--71.Google Scholar
- Grzegorz Malinowski. 2014. Kleene logic and inference. Bull. Section Logic 43, 1/2 (2014), 42--52.Google Scholar
- Leonard R. Marino. 1981. General theory of metastable operation. IEEE Trans. Comput. 30, 2 (1981), 107--115. Google ScholarDigital Library
- K. Mehlhorn and Z. Galil. 1976. Monotone switching circuits and boolean matrix product. Computing 16, 1 (01 Mar. 1976), 99--111.Google Scholar
- M. Mukaidono. 1972. On the B-ternary logical function—A ternary logic considering ambiguity. Syst. Comput. Controls 3, 3 (1972), 27--36.Google Scholar
- M. Mukaidono. 1983. Advanced results on application of fuzzy switching functions to hazard detection. In Advances in Fuzzy Sets, Possibility Theory and Applications, P. P. Wong (Ed.). Plenum Publishing, 335--349.Google Scholar
- M. Mukaidono. 1983. Regular ternary logic functions—Ternary logic functions suitable for treating ambiguity. In Proceedings of the 13th International Symposium on Multiple-Valued Logic. IEEE Computer Society Press, 286--291.Google Scholar
- S. M. Nowick and D. L. Dill. 1992. Exact two-level minimization of hazard-free logic with multiple-input changes. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. 626--630. Google ScholarDigital Library
- Michael S. Paterson. 1975. Complexity of monotone networks for Boolean matrix product. Theoret. Comput. Sci. 1, 1 (1975), 13--20. Google ScholarDigital Library
- Pedro Ponce-Cruz and Fernando D. Ramírez-Figueroa. 1979. Intelligent Control Systems with LabVIEW. Springer-Verlag, London. Google ScholarDigital Library
- Vaughan R. Pratt. 1974. The power of negative thinking in multiplying boolean matrices. In Proceedings of the 6th Annual ACM Symposium on Theory of Computing (STOC’74). ACM, New York, NY, 80--83. Google ScholarDigital Library
- Ran Raz and Avi Wigderson. 1992. Monotone circuits for matching require linear depth. J. ACM 39, 3 (1992), 736--744. Google ScholarDigital Library
- Alexander A. Razborov. 1985. Lower bounds on monotone complexity of the logical permanent. Math. Notes 37, 6 (1985), 485--493.Google ScholarCross Ref
- Raul Rojas. 1996. Neural Networks—A Systematic Introduction. Springer-Verlag, Berlin. Google ScholarDigital Library
- Volker Strassen. 1969. Gaussian elimination is not optimal. Numer. Math. 13 (1969), 354--356. Google ScholarDigital Library
- G. Tarawneh and A. Yakovlev. 2012. An RTL method for hiding clock domain crossing latency. In Proceedings of the 19th IEEE International Conference on Electronics, Circuits, and Systems (ICECS’12). 540--543.Google Scholar
- G. Tarawneh, A. Yakovlev, and T. Mak. 2014. Eliminating synchronization latency using sequenced latching. IEEE Trans. Very Large Scale Integr. Syst. 22, 2 (Feb. 2014), 408--419. Google ScholarDigital Library
- É. Tardos. 1988. The gap between monotone and non-monotone circuit complexity is exponential. Combinatorica 8, 1 (Mar. 1988), 141--142.Google Scholar
- Mohit Tiwari, Hassan M. G. Wassel, Bita Mazloom, Shashidhar Mysore, Frederic T. Chong, and Timothy Sherwood. 2009. Complete information flow tracking from the gates up. SIGARCH Comput. Archit. News 37, 1 (Mar. 2009), 109--120. Google ScholarDigital Library
- S. H. Unger. 1995. Hazards, critical races, and metastability. IEEE Trans. Comput. 44, 6 (June 1995), 754--768. Google ScholarDigital Library
- Ingo Wegener. 1982. Boolean functions whose monotone complexity is of size n<sup>2</sup>/log n. Lect. Notes Comput. Sci. 21 (Nov. 1982), 213--224.Google Scholar
- A. C. Yao. 1989. Circuits and local computation. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC’89). ACM, New York, NY, 186--196. Google ScholarDigital Library
- Michael Yoeli and Shlomo Rinon. 1964. Application of ternary algebra to the study of static hazards. J. ACM 11, 1 (Jan 1964), 84--97. Google ScholarDigital Library
- Y. Zisapel, M. Krieger, and J. Kella. 1979. Detection of hazards in combinational switching circuits. IEEE Trans. Comput. C-28, 1 (Jan. 1979), 52--56. Google ScholarDigital Library
Index Terms
- On the Complexity of Hazard-free Circuits
Recommendations
On the complexity of hazard-free circuits
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingThe 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 ...
Computational Complexity of Controllability/Observability Problems for Combinational Circuits
The computational complexity of fault detection problems and various controllability and observability problems for combinational logic circuits are analyzed. It is shown that the fault detection problem is still NP-complete for monotone circuits ...
Notes on Hazard-Free Circuits
The problem of constructing hazard-free Boolean circuits (those avoiding electronic glitches) dates back to the 1940s and is an important problem in circuit design and even in cybersecurity. We show that a DeMorgan circuit, that is, a Boolean AND, OR, NOT ...
Comments