Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find




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

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2021, Volume 61, Number 2, Pages 345–362
DOI: https://doi.org/10.31857/S0044466921020125 (Mi zvmmf11203) 		 
Computer science

On the upper bound of the complexity of sorting

I. S. Sergeev

Research Institute "Kvant", Moscow
References:
PDF
HTML
DOI: https://doi.org/10.31857/S0044466921020125
Abstract: It is shown that $\log_2(n!)+o(n)$ pairwise comparisons is sufficient for sorting any subset of $n$ elements of a linearly ordered set.
Key words: sorting, complexity, decision tree, partial order, simplex.
Funding agency Grant number
Russian Foundation for Basic Research 19-01-00294а
This work was supported by the Russian Foundation for Basic Research, project no. 19-01-00294а.
Received: 18.09.2019
Revised: 23.07.2020
Accepted: 16.09.2020
English version:
Computational Mathematics and Mathematical Physics, 2021, Volume 61, Issue 2, Pages 329–346
DOI: https://doi.org/10.1134/S0965542521020111
Bibliographic databases:
Document Type: Article
UDC: 519
Language: Russian
Citation: I. S. Sergeev, “On the upper bound of the complexity of sorting”, Zh. Vychisl. Mat. Mat. Fiz., 61:2 (2021), 345–362; Comput. Math. Math. Phys., 61:2 (2021), 329–346
Citation in format AMSBIB
\Bibitem{Ser21}
\by I.~S.~Sergeev
\paper On the upper bound of the complexity of sorting
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2021
\vol 61
\issue 2
\pages 345--362
\mathnet{http://mi.mathnet.ru/zvmmf11203}
\crossref{https://doi.org/10.31857/S0044466921020125}
\elib{https://elibrary.ru/item.asp?id=44732415}
\transl
\jour Comput. Math. Math. Phys.
\yr 2021
\vol 61
\issue 2
\pages 329--346
\crossref{https://doi.org/10.1134/S0965542521020111}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=WOS:000637836300012}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85104117089}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf11203
  • https://www.mathnet.ru/eng/zvmmf/v61/i2/p345
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024