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, 1999, Volume 11, Issue 1, Pages 146–150
DOI: https://doi.org/10.4213/dm359
(Mi dm359)
 

This article is cited in 1 scientific paper (total in 1 paper)

On the realization of linear Boolean operators by nonbranching programs with a conditional stop

A. V. Chashkin
Full-text PDF (539 kB) Citations (1)
Abstract: The complexity of the realization of linear Boolean operators by straight-line programs with a conditional stop is considered. Exact, in order of magnitude, bounds on the average execution time of almost all such operators are found.
This research was supported by the Russian Foundation for Basic Research, grant 96–01–01068, and the Federal Program ‘Integration’, grant 473.
Received: 04.07.1998
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. V. Chashkin, “On the realization of linear Boolean operators by nonbranching programs with a conditional stop”, Diskr. Mat., 11:1 (1999), 146–150; Discrete Math. Appl., 9:2 (1999), 161–165
Citation in format AMSBIB
\Bibitem{Cha99}
\by A.~V.~Chashkin
\paper On the realization of linear Boolean operators by nonbranching programs with a conditional stop
\jour Diskr. Mat.
\yr 1999
\vol 11
\issue 1
\pages 146--150
\mathnet{http://mi.mathnet.ru/dm359}
\crossref{https://doi.org/10.4213/dm359}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1702904}
\zmath{https://zbmath.org/?q=an:0966.68079}
\transl
\jour Discrete Math. Appl.
\yr 1999
\vol 9
\issue 2
\pages 161--165
Linking options:
  • https://www.mathnet.ru/eng/dm359
  • https://doi.org/10.4213/dm359
  • https://www.mathnet.ru/eng/dm/v11/i1/p146
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:351
    Full-text PDF :225
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024