Diskretnaya Matematika
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


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




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

Diskretnaya Matematika, 2000, Volume 12, Issue 4, Pages 109–120
DOI: https://doi.org/10.4213/dm348 (Mi dm348) 		 
This article is cited in 3 scientific papers (total in 3 papers)

On the mean time for computing the values of elementary Boolean functions

A. V. Chashkin
Full-text PDF (1119 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm348
Abstract: The disjunction, conjunction, and linear function, each depending on an increasing number of arguments, are computed by straight-line programs with a conditional stop. Asymptotically exact formulas for the average-case complexity of these functions are found. It is shown that the average-case complexities of disjunction and conjunction are constants and the average-case complexity of the linear function coincides with its circuit size.
The research was supported by the Russian Foundation for Basic Research, grant 99-01-01175, and the Federal Program 'Integration', grant 473.
Received: 14.07.2000
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. V. Chashkin, “On the mean time for computing the values of elementary Boolean functions”, Diskr. Mat., 12:4 (2000), 109–120; Discrete Math. Appl., 11:1 (2001), 71–81
Citation in format AMSBIB
\Bibitem{Cha00}
\by A.~V.~Chashkin
\paper On the mean time for computing the values of elementary Boolean functions
\jour Diskr. Mat.
\yr 2000
\vol 12
\issue 4
\pages 109--120
\mathnet{http://mi.mathnet.ru/dm348}
\crossref{https://doi.org/10.4213/dm348}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1826183}
\zmath{https://zbmath.org/?q=an:1088.68608}
\transl
\jour Discrete Math. Appl.
\yr 2001
\vol 11
\issue 1
\pages 71--81
Linking options:
  • https://www.mathnet.ru/eng/dm348
  • https://doi.org/10.4213/dm348
  • https://www.mathnet.ru/eng/dm/v12/i4/p109
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:516
    Full-text PDF :274
    References:50
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024