Circuit Complexity of k-Valued Logic Functions in One Infinite Basis
- 2 Downloads
We investigate the realization complexity of k -valued logic functions k 2 by combinational circuits in an infinite basis that includes the negation of the Lukasiewicz function, i.e., the function k−1−x, and all monotone functions. Complexity is understood as the total number of circuit elements. For an arbitrary function f, we establish lower and upper complexity bounds that differ by at most by 2 and have the form 2 log (d(f) + 1) + o(1), where d(f) is the maximum number of times the function f switches from larger to smaller value (the maximum is taken over all increasing chains of variable tuples). For all sufficiently large n, we find the exact value of the Shannon function for the realization complexity of the most complex function of n variables.
Keywordsmulti-valued logic functions logic circuits circuit complexity infinite basis non-monotone complexity inversion complexity Markov theorem
Unable to display preview. Download preview PDF.
- 5.O. B. Lupanov, Asymptotic Complexity Bounds for Control Systems [in Russian], Izd. MGU, Moscow (1984).Google Scholar
- 6.V. V. Kochergin and A. V. Mikhailovich, “On the complexity of circuits in bases containing monotone elements with zero weights,” Prikl. Diskr. Matem., No. 4(30), 24–31 (2015).Google Scholar
- 7.V. V. Kochergin and A. V. Mikhailovich, “Asymptotics of growth for the non-monotone complexity of multi-valued logic function systems,” Siberian Electronic Mathematical Reports (http://semr.math.msc.ru), 14, 1100–1107 (2017).
- 8.V. V. Kochergin and A. V. Mikhailovich, “Exact value of non-monotone complexity of Boolean functions,” Matem. Zametki (in print).Google Scholar