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, 2008, Volume 20, Issue 1, Pages 109–119
DOI: https://doi.org/10.4213/dm994 (Mi dm994) 		 
On complexity of linear operators on the class of circuits of depth 2

D. Yu. Cherukhin
Full-text PDF (151 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm994
Abstract: In this study we suggest methods for obtaining lower bounds for complexity of linear Boolean operators (and the related matrices) in two models of circuits of depth 2. In the first model, only linear elements with arbitrary number of inputs are allowed, whereas in the second one, any Boolean elements can be present. These methods are applicable to matrices with sufficiently large Hamming distance between the rows, for example, to the Hadamard matrices.
Received: 29.11.2005
English version:
Discrete Mathematics and Applications, 2008, Volume 18, Issue 2, Pages 143–154
DOI: https://doi.org/10.1515/DMA.2008.011
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: D. Yu. Cherukhin, “On complexity of linear operators on the class of circuits of depth 2”, Diskr. Mat., 20:1 (2008), 109–119; Discrete Math. Appl., 18:2 (2008), 143–154
Citation in format AMSBIB
\Bibitem{Che08}
\by D.~Yu.~Cherukhin
\paper On complexity of linear operators on the class of circuits of depth~2
\jour Diskr. Mat.
\yr 2008
\vol 20
\issue 1
\pages 109--119
\mathnet{http://mi.mathnet.ru/dm994}
\crossref{https://doi.org/10.4213/dm994}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2420502}
\zmath{https://zbmath.org/?q=an:1172.94655}
\elib{https://elibrary.ru/item.asp?id=20730234}
\transl
\jour Discrete Math. Appl.
\yr 2008
\vol 18
\issue 2
\pages 143--154
\crossref{https://doi.org/10.1515/DMA.2008.011}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-44449088031}
Linking options:
  • https://www.mathnet.ru/eng/dm994
  • https://doi.org/10.4213/dm994
  • https://www.mathnet.ru/eng/dm/v20/i1/p109
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:411
    Full-text PDF :116
    References:30
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024