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 4, Pages 111–115
DOI: https://doi.org/10.4213/dm134 (Mi dm134) 		 
The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity

A. A. Voronenko
Full-text PDF (579 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm134
Abstract: We prove that the representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity.
This research was supported by the Russian Foundation for Basic Research, grant 04–01–00359.
Received: 13.06.2005
English version:
Discrete Mathematics and Applications, 2005, Volume 15, Issue 5, Pages 507–511
DOI: https://doi.org/10.1515/156939205776368913
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. A. Voronenko, “The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity”, Diskr. Mat., 17:4 (2005), 111–115; Discrete Math. Appl., 15:5 (2005), 507–511
Citation in format AMSBIB
\Bibitem{Vor05}
\by A.~A.~Voronenko
\paper The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity
\jour Diskr. Mat.
\yr 2005
\vol 17
\issue 4
\pages 111--115
\mathnet{http://mi.mathnet.ru/dm134}
\crossref{https://doi.org/10.4213/dm134}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2240546}
\zmath{https://zbmath.org/?q=an:1103.94306}
\elib{https://elibrary.ru/item.asp?id=9154207}
\transl
\jour Discrete Math. Appl.
\yr 2005
\vol 15
\issue 5
\pages 507--511
\crossref{https://doi.org/10.1515/156939205776368913}
Linking options:
  • https://www.mathnet.ru/eng/dm134
  • https://doi.org/10.4213/dm134
  • https://www.mathnet.ru/eng/dm/v17/i4/p111
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:687
    Full-text PDF :252
    References:70
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024