Abstract
A binary sequence x 1, ..., x n is called k-tonic if it contains at most k changes between 0 and 1, i.e., there are at most k indices such that x i ≠x i + 1. A sequence ¬x 1, ..., ¬x n is called an inversion of x 1, ..., x n . In this paper, we investigate the size of a negation-limited circuit, which is a Boolean circuit with a limited number of NOT gates, that sorts or inverts k-tonic input sequences. We show that if k = O(1) and t = O(loglogn), a k-tonic sequence of length n can be sorted by a circuit with t NOT gates whose size is O((n logn)/ 2ct) where c > 0 is some constant. This generalizes a similar upper bound for merging by Amano, Maruoka and Tarui [4], which corresponds to the case k = 2. We also show that a k-tonic sequence of length n can be inverted by a circuit with O(k logn) NOT gates whose size is O(kn) and depth is O(k log2 n). This reduces the size of the negation-limited inverter of size O(n logn) by Beals, Nishino and Tanaka [6] when k = o(logn). If k = O(1), our inverter has size O(n) and depth O(log2 n) and contains O(logn) NOT gates. For this case, the size and the number of NOT gates are optimal up to a constant factor.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ajtai, M., Komós, J., Szemerédi, E.: An O(n logn) Sorting Network. In: Proc. 15th STOC, pp. 1–9 (1983)
Alon, N., Boppana, R.B.: The Monotone Circuit Complexity of Boolean Functions. Combinatorica 7(1), 1–22 (1987)
Amano, K., Maruoka, A.: A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most \((1/6) \log\ \log n\) Negation Gates. SIAM J. Comput. 35(1), 201–216 (2005)
Amano, K., Maruoka, A., Tarui, J.: On the Negation-Limited Circuit Complexity of Merging. Discrete Applied Mathematics 126(1), 3–8 (2003)
Andreev, A.E.: On a Method for Obtaining Lower Bounds for the Complexity of Individual Monotone Functions. Sov. Math. Dokl. 31(3), 530–534 (1985)
Beals, R., Nishino, T., Tanaka, K.: More on the Complexity of Negation-Limited Circuits. In: Proc. 27th STOC, pp. 585–595 (1995)
Fischer, M.J.: The Complexity of Negation-Limited Network–A Brief Survey, LNCS, vol. 33, pp. 71–82. Springer, Heidelberg (1974)
Harnik, D., Raz, R.: Higher Lower Bounds on Monotone Size. In: Proc. 32nd STOC, pp. 378–387 (2000)
Jukna, S.: On the Minimum Number of Negations Leading to Super-Polynomial Savings. Inf. Process. Lett. 89(2), 71–74 (2004)
Lamagna, E.A.: The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting and Merging. IEEE Trans. of Comput. 28(10), 773–782 (1979)
Markov, A.A.: On the Inversion Complexity of a System of Functions. J. ACM 5, 331–334 (1958)
Muller, D.E., Preparata, F.P.: Bounds to Complexities of Networks for Sorting and Switching. J. ACM 22, 195–201 (1975)
Razborov, A.A.: Lower Bounds on the Monotone Complexity of Some Boolean Functions. Soviet Math. Dokl. 281, 798–801 (1985)
Sung, S.C., Tanaka, K.: An Exponential Gap with the Removal of One Negation Gates. Inf. Process. Let. 82(3), 155–157 (2002)
Tanaka, K., Nishino, T.: On the Complexity of Negation-Limited Boolean Networks. SIAM J. Comput. 27(5), 1334–1347 (1998)
Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner, Chichester (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sato, T., Amano, K., Maruoka, A. (2006). On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_13
Download citation
DOI: https://doi.org/10.1007/11809678_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)