Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2023, Volume 35, Issue 4, Pages 126–131
DOI: https://doi.org/10.4213/dm1789 (Mi dm1789) 		 
A lower bound on the monotone switching complexity of the threshold function $T_n^{n-1}$

I. S. Sergeev

Research Institute «Kvant», Moscow
Full-text PDF (504 kB) English version article
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1789
Abstract: We prove that the complexity of computation of the threshold symmetric function $T_n^{n-1}$ by monotone switching networks is $\Omega(n \log \log n)$.
Keywords: switching networks, threshold functions, monotone computations.
Received: 20.08.2023
Published: 28.11.2023
English version:
Discrete Mathematics and Applications, 2025, Volume 35, Issue 5, Pages 327–330
DOI: https://doi.org/10.1515/dma-2025-0026
Bibliographic databases:
Document Type: Article
UDC: 519.714.4
Language: Russian
Citation: I. S. Sergeev, “A lower bound on the monotone switching complexity of the threshold function $T_n^{n-1}$”, Diskr. Mat., 35:4 (2023), 126–131; Discrete Math. Appl., 35:5 (2025), 327–330
Citation in format AMSBIB
\Bibitem{Ser23}
\by I.~S.~Sergeev
\paper A lower bound on the monotone switching complexity of the threshold function $T_n^{n-1}$
\jour Diskr. Mat.
\yr 2023
\vol 35
\issue 4
\pages 126--131
\mathnet{http://mi.mathnet.ru/dm1789}
\crossref{https://doi.org/10.4213/dm1789}
\transl
\jour Discrete Math. Appl.
\yr 2025
\vol 35
\issue 5
\pages 327--330
\crossref{https://doi.org/10.1515/dma-2025-0026}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-105028579686}
Linking options:
  • https://www.mathnet.ru/eng/dm1789
  • https://doi.org/10.4213/dm1789
  • https://www.mathnet.ru/eng/dm/v35/i4/p126
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:360
    Full-text PDF :119
    References:119
    First page:32
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026