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, 2003, Volume 15, Issue 2, Pages 113–122
DOI: https://doi.org/10.4213/dm198
(Mi dm198)
 

This article is cited in 8 scientific papers (total in 8 papers)

On the activity of cell circuits realising the system of all conjunctions

O. V. Cheremisin
Full-text PDF (805 kB) Citations (8)
References:
Abstract: We investigate the activity of cell circuits, the measure of their complexity, which describes the functioning of such circuits from the energy point of view. For the system $K_n$ of all elementary conjunctions of $n$ variables we find the order of the minimal activity as $n\to\infty$. We prove that it is impossible to reach simultaneously the minimal in order activity and complexity of realising the system $K_n$ in the class of cell circuits.
Received: 28.10.2002
English version:
Discrete Mathematics and Applications, 2003, Volume 13, Issue 2, Pages 209–219
DOI: https://doi.org/10.1515/156939203322109159
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: O. V. Cheremisin, “On the activity of cell circuits realising the system of all conjunctions”, Diskr. Mat., 15:2 (2003), 113–122; Discrete Math. Appl., 13:2 (2003), 209–219
Citation in format AMSBIB
\Bibitem{Che03}
\by O.~V.~Cheremisin
\paper On the activity of cell circuits realising the system of all
conjunctions
\jour Diskr. Mat.
\yr 2003
\vol 15
\issue 2
\pages 113--122
\mathnet{http://mi.mathnet.ru/dm198}
\crossref{https://doi.org/10.4213/dm198}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2006680}
\zmath{https://zbmath.org/?q=an:1047.94516}
\transl
\jour Discrete Math. Appl.
\yr 2003
\vol 13
\issue 2
\pages 209--219
\crossref{https://doi.org/10.1515/156939203322109159}
Linking options:
  • https://www.mathnet.ru/eng/dm198
  • https://doi.org/10.4213/dm198
  • https://www.mathnet.ru/eng/dm/v15/i2/p113
  • 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:523
    Full-text PDF :267
    References:32
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024