Document Open Access Logo

Towards Simpler Sorting Networks and Monotone Circuits for Majority

Authors Natalia Dobrokhotova-Maikova , Alexander Kozachinskiy , Vladimir Podolskii

PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2024.50.pdf
  • Filesize: 0.74 MB
  • 18 pages

Document Identifiers

Author Details

Natalia Dobrokhotova-Maikova
  • Yandex, Tel Aviv, Israel
Alexander Kozachinskiy
  • IMFD & CENIA, Santiago, Chile
Vladimir Podolskii
  • Tufts University, Medford, MA, USA

Funding

  • Kozachinskiy, Alexander: funded by the National Center for Artificial Intelligence CENIA FB210017, Basal ANID, and by the Millennium Science Initiative Program - Code ICN17002.

Cite AsGet BibTex

Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, and Vladimir Podolskii. Towards Simpler Sorting Networks and Monotone Circuits for Majority. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 50:1-50:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.50

Abstract

In this paper, we study the problem of computing the majority function by low-depth monotone circuits and a related problem of constructing low-depth sorting networks. We consider both the classical setting with elementary operations of arity 2 and the generalized setting with operations of arity k, where k is a parameter. For both problems and both settings, there are various constructions known, the minimal known depth being logarithmic. However, there is currently no known efficient deterministic construction that simultaneously achieves sub-log-squared depth, simplicity, and has a potential to be used in practice. In this paper we make progress towards resolution of this problem. For computing majority by standard monotone circuits (gates of arity 2) we provide an explicit monotone circuit of depth O(log₂^{5/3} n). The construction is a combination of several known and not too complicated ideas. Essentially, for this result we gradually derandomize the construction of Valiant (1984). As one of the intermediate steps in our result we need an efficient construction of a sorting network with gates of arity k for arbitrary fixed k. For this we provide a new sorting network architecture inspired by representation of inputs as a high-dimensional cube. As a result we obtain a simple construction that improves previous upper bound of 4 log_k² n to 2 log_k² n. We prove the similar bound for the depth of the circuit computing majority of n bits consisting of gates computing majority of k bits. Note, that for both problems there is an explicit construction of depth O(log_k n) known, but the construction is complicated and the constant hidden in O-notation is huge.

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
Keywords
  • Sorting networks
  • constant depth
  • lower bounds
  • threshold circuits

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Miklós Ajtai, János Komlós, and Endre Szemerédi. Sorting in c log n parallel steps. Comb., 3(1):1-19, 1983. URL: https://doi.org/10.1007/BF02579338.
  2. Kenneth E. Batcher. Sorting networks and their applications. In American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1968 Spring Joint Computer Conference, Atlantic City, NJ, USA, 30 April - 2 May 1968, volume 32 of AFIPS Conference Proceedings, pages 307-314. Thomson Book Company, Washington D.C., 1968. URL: https://doi.org/10.1145/1468075.1468121.
  3. Richard Beigel and John Gill. Sorting n objects with a k-sorter. IEEE Trans. Computers, 39(5):714-716, 1990. URL: https://doi.org/10.1109/12.53587.
  4. Mihir Bellare and John Rompel. Randomness-efficient oblivious sampling. In 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pages 276-287. IEEE Computer Society, 1994. URL: https://doi.org/10.1109/SFCS.1994.365687.
  5. Gianfranco Bilardi and Franco P. Preparata. A minimum area VLSI network for o(log n) time sorting. In Richard A. DeMillo, editor, Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1984, Washington, DC, USA, pages 64-70. ACM, 1984. URL: https://doi.org/10.1145/800057.808666.
  6. V. Chvátal. Lecture notes on the new AKS sorting network. Technical report, Department of Computer Science, Rutgers University, 1992. Google Scholar
  7. Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, and Ron D. Rothblum. Efficient multiparty protocols via log-depth threshold formulae - (extended abstract). In Ran Canetti and Juan A. Garay, editors, Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II, volume 8043 of Lecture Notes in Computer Science, pages 185-202. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-40084-1_11.
  8. Robert Cypher and Jorge L. C. Sanz. Cubesort: A parallel algorithm for sorting N data items with s-sorters. J. Algorithms, 13(2):211-234, 1992. URL: https://doi.org/10.1016/0196-6774(92)90016-6.
  9. Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, and Vladimir V. Podolskii. Constant-depth sorting networks. In Yael Tauman Kalai, editor, 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA, volume 251 of LIPIcs, pages 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.ITCS.2023.43.
  10. Caxton C Foster and Fred D Stockton. Counting responders in an associative memory. IEEE Transactions on Computers, 100(12):1580-1583, 1971. Google Scholar
  11. Qingshi Gao and Zhiyong Liu. Sloping-and-shaking. Science in China Series E: Technological Sciences, 40(3):225-234, 1997. Google Scholar
  12. Oded Goldreich. On (valiant’s) polynomial-size monotone formula for majority. In Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation, pages 17-23. Springer, 2020. Google Scholar
  13. Shlomo Hoory, Avner Magen, and Toniann Pitassi. Monotone circuits for the majority function. In Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation, pages 410-425, 2006. Google Scholar
  14. Stasys Jukna. Boolean Function Complexity - Advances and Frontiers, volume 27 of Algorithms and combinatorics. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-24508-4.
  15. Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, and Endre Szemerédi. Lower bounds for sorting networks. In Frank Thomson Leighton and Allan Borodin, editors, Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA, pages 437-446. ACM, 1995. URL: https://doi.org/10.1145/225058.225178.
  16. Donald Ervin Knuth. The art of computer programming, Volume III, 2nd Edition. Addison-Wesley, 1998. URL: https://www.worldcat.org/oclc/312994415.
  17. Clemens Lautemann. Bpp and the polynomial hierarchy. Information Processing Letters, 17(4):215-217, 1983. Google Scholar
  18. De-Lei Lee and Kenneth E. Batcher. A multiway merge sorting network. IEEE Trans. Parallel Distributed Syst., 6(2):211-215, 1995. URL: https://doi.org/10.1109/71.342136.
  19. Frank Thomson Leighton. Tight bounds on the complexity of parallel sorting. IEEE Trans. Computers, 34(4):344-354, 1985. URL: https://doi.org/10.1109/TC.1985.5009385.
  20. David E Muller and Franco P Preparata. Bounds to complexities of networks for sorting and for switching. Journal of the ACM (JACM), 22(2):195-201, 1975. Google Scholar
  21. Toshio Nakatani, Shing-Tsaan Huang, Bruce W. Arden, and Satish K. Tripathi. K-way bitonic sort. IEEE Trans. Computers, 38(2):283-288, 1989. URL: https://doi.org/10.1109/12.16506.
  22. Ian Parberry. The pairwise sorting network. Parallel Process. Lett., 2:205-211, 1992. URL: https://doi.org/10.1142/S0129626492000337.
  23. Bruce Parker and Ian Parberry. Constructing sorting networks from k-sorters. Inf. Process. Lett., 33(3):157-162, 1989. URL: https://doi.org/10.1016/0020-0190(89)90196-8.
  24. Michael S Paterson. Improved sorting networks with o (logn) depth. Algorithmica, 5(1):75-92, 1990. Google Scholar
  25. Claus-Peter Schnorr and Adi Shamir. An optimal sorting algorithm for mesh connected computers. In Juris Hartmanis, editor, Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, USA, pages 255-263. ACM, 1986. URL: https://doi.org/10.1145/12130.12156.
  26. Joel Seiferas. Sorting networks of logarithmic depth, further simplified. Algorithmica, 53(3):374-384, 2009. Google Scholar
  27. Sandeep Sen, Isaac D. Scherson, and Adi Shamir. Shear sort: A true two-dimensional sorting techniques for VLSI networks. In International Conference on Parallel Processing, ICPP'86, University Park, PA, USA, August 1986, pages 903-908. IEEE Computer Society Press, 1986. Google Scholar
  28. Feng Shi, Zhiyuan Yan, and Meghanad D. Wagh. An enhanced multiway sorting network based on n-sorters. In 2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014, Atlanta, GA, USA, December 3-5, 2014, pages 60-64. IEEE, 2014. URL: https://doi.org/10.1109/GlobalSIP.2014.7032078.
  29. Michael Sipser. A complexity theoretic approach to randomness. In Proceedings of the fifteenth annual ACM symposium on Theory of computing, pages 330-335, 1983. Google Scholar
  30. S. S. Tseng and Richard C. T. Lee. A parallel sorting scheme whose basic operation sortsN elements. Int. J. Parallel Program., 14(6):455-467, 1985. URL: https://doi.org/10.1007/BF00991185.
  31. Salil P. Vadhan. Pseudorandomness. Found. Trends Theor. Comput. Sci., 7(1-3):1-336, 2012. URL: https://doi.org/10.1561/0400000010.
  32. Leslie G. Valiant. Short monotone formulae for the majority function. J. Algorithms, 5(3):363-366, 1984. URL: https://doi.org/10.1016/0196-6774(84)90016-6.
  33. Emanuele Viola. On approximate majority and probabilistic time. Computational Complexity, 18:337-375, 2009. Google Scholar
  34. Andrew Chi-Chih Yao. Bounds on selection networks. SIAM J. Comput., 9(3):566-582, 1980. URL: https://doi.org/10.1137/0209043.
  35. Lijun Zhao, Zhiyong Liu, and Qingshi Gao. An efficient multiway merging algorithm. Science in China Series E: Technological Sciences, 41(5):543-551, 1998. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact