On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences

  • Takayuki Sato
  • Kazuyuki Amano
  • Akira Maruoka
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4112)


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)/ 2 ct ) 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.


Boolean Function Input Sequence Binary Sequence Binary Representation Circuit Complexity 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ajtai, M., Komós, J., Szemerédi, E.: An O(n logn) Sorting Network. In: Proc. 15th STOC, pp. 1–9 (1983)Google Scholar
  2. 2.
    Alon, N., Boppana, R.B.: The Monotone Circuit Complexity of Boolean Functions. Combinatorica 7(1), 1–22 (1987)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    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)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Amano, K., Maruoka, A., Tarui, J.: On the Negation-Limited Circuit Complexity of Merging. Discrete Applied Mathematics 126(1), 3–8 (2003)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    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)MATHGoogle Scholar
  6. 6.
    Beals, R., Nishino, T., Tanaka, K.: More on the Complexity of Negation-Limited Circuits. In: Proc. 27th STOC, pp. 585–595 (1995)Google Scholar
  7. 7.
    Fischer, M.J.: The Complexity of Negation-Limited Network–A Brief Survey, LNCS, vol. 33, pp. 71–82. Springer, Heidelberg (1974)Google Scholar
  8. 8.
    Harnik, D., Raz, R.: Higher Lower Bounds on Monotone Size. In: Proc. 32nd STOC, pp. 378–387 (2000)Google Scholar
  9. 9.
    Jukna, S.: On the Minimum Number of Negations Leading to Super-Polynomial Savings. Inf. Process. Lett. 89(2), 71–74 (2004)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    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)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Markov, A.A.: On the Inversion Complexity of a System of Functions. J. ACM 5, 331–334 (1958)MATHCrossRefGoogle Scholar
  12. 12.
    Muller, D.E., Preparata, F.P.: Bounds to Complexities of Networks for Sorting and Switching. J. ACM 22, 195–201 (1975)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Razborov, A.A.: Lower Bounds on the Monotone Complexity of Some Boolean Functions. Soviet Math. Dokl. 281, 798–801 (1985)MathSciNetGoogle Scholar
  14. 14.
    Sung, S.C., Tanaka, K.: An Exponential Gap with the Removal of One Negation Gates. Inf. Process. Let. 82(3), 155–157 (2002)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Tanaka, K., Nishino, T.: On the Complexity of Negation-Limited Boolean Networks. SIAM J. Comput. 27(5), 1334–1347 (1998)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner, Chichester (1987)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Takayuki Sato
    • 1
  • Kazuyuki Amano
    • 2
  • Akira Maruoka
    • 3
  1. 1.Dept. of Information EngineeringSendai National College of TechnologySendaiJapan
  2. 2.Dept. of Computer ScienceGunma UniversityGunmaJapan
  3. 3.Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations