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, 2005, Volume 17, Issue 2, Pages 139–143
DOI: https://doi.org/10.4213/dm105 (Mi dm105) 		 
This article is cited in 8 scientific papers (total in 8 papers)

On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$

A. A. Voronenko
Full-text PDF (567 kB) Citations (8)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm105
Abstract: In this paper, we present upper and lower linear bounds for the Shannon function for length of checking tests for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$.
The research was supported by Russian Foundation for Basic Research, grants 04–01–00359 and 05–01–01000.
Received: 29.01.2005
English version:
Discrete Mathematics and Applications, 2005, Volume 15, Issue 3, Pages 313–318
DOI: https://doi.org/10.1515/156939205774464503
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. A. Voronenko, “On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$”, Diskr. Mat., 17:2 (2005), 139–143; Discrete Math. Appl., 15:3 (2005), 313–318
Citation in format AMSBIB
\Bibitem{Vor05}
\by A.~A.~Voronenko
\paper On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$
\jour Diskr. Mat.
\yr 2005
\vol 17
\issue 2
\pages 139--143
\mathnet{http://mi.mathnet.ru/dm105}
\crossref{https://doi.org/10.4213/dm105}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2167807}
\zmath{https://zbmath.org/?q=an:1103.94040}
\elib{https://elibrary.ru/item.asp?id=9135430}
\transl
\jour Discrete Math. Appl.
\yr 2005
\vol 15
\issue 3
\pages 313--318
\crossref{https://doi.org/10.1515/156939205774464503}
Linking options:
  • https://www.mathnet.ru/eng/dm105
  • https://doi.org/10.4213/dm105
  • https://www.mathnet.ru/eng/dm/v17/i2/p139
    • This publication is cited in the following 8 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:521
    Full-text PDF :260
    References:55
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024