RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2011, Volume 18, Number 6, Pages 71–81 (Mi da671)  

On distributed circuits

E. A. Okolnishnikova


Abstract: The class of distributed circuits is introduced. These circuits simulate the computation by distributed memory machines. Some bounds on the complexity of computation for Boolean functions and systems of Boolean functions are proved. Bibliogr. 10.

Keywords: computation complexity, combinatorial circuit, computation simulation.

Full text: PDF file (259 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.8
Received: 03.12.2010

Citation: E. A. Okolnishnikova, “On distributed circuits”, Diskretn. Anal. Issled. Oper., 18:6 (2011), 71–81

Citation in format AMSBIB
\Bibitem{Oko11}
\by E.~A.~Okolnishnikova
\paper On distributed circuits
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 6
\pages 71--81
\mathnet{http://mi.mathnet.ru/da671}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2953801}
\zmath{https://zbmath.org/?q=an:1249.68077}


Linking options:
  • http://mi.mathnet.ru/eng/da671
  • http://mi.mathnet.ru/eng/da/v18/i6/p71

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:151
    Full text:47
    References:24
    First page:2

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020