Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 6, Pages 71–81 (Mi da671)  
On distributed circuits

E. A. Okolnishnikova
Full-text PDF (259 kB)
References:
PDF
HTML
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.
Received: 03.12.2010
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
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://mathscinet.ams.org/mathscinet-getitem?mr=2953801}
\zmath{https://zbmath.org/?q=an:1249.68077}
Linking options:
  • https://www.mathnet.ru/eng/da671
  • https://www.mathnet.ru/eng/da/v18/i6/p71
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:254
    Full-text PDF :65
    References:41
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024