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., 2012, Volume 19, Number 3, Pages 3–12 (Mi da686)  

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

The computation complexity in the class of formulas

S. V. Avgustinovichab, Yu. L. Vasil'eva, K. L. Rychkova

a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia

Abstract: The exact value 18 of the computation complexity in the class of generalized $P$-schemes of ternary counter of multiplicity 3 dependent on 3 variables is obtained. Bibliogr. 6.

Keywords: computation complexity, generalized $P$-schemes, ternary linear function.

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

English version:
Journal of Applied and Industrial Mathematics, 2012, 6:4, 403–409

Bibliographic databases:

UDC: 519.714
Received: 11.07.2011
Revised: 30.11.2011

Citation: S. V. Avgustinovich, Yu. L. Vasil'ev, K. L. Rychkov, “The computation complexity in the class of formulas”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 3–12; J. Appl. Industr. Math., 6:4 (2012), 403–409

Citation in format AMSBIB
\Bibitem{AvgVasRyc12}
\by S.~V.~Avgustinovich, Yu.~L.~Vasil'ev, K.~L.~Rychkov
\paper The computation complexity in the class of formulas
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 3
\pages 3--12
\mathnet{http://mi.mathnet.ru/da686}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2986637}
\transl
\jour J. Appl. Industr. Math.
\yr 2012
\vol 6
\issue 4
\pages 403--409
\crossref{https://doi.org/10.1134/S1990478912040011}


Linking options:
  • http://mi.mathnet.ru/eng/da686
  • http://mi.mathnet.ru/eng/da/v19/i3/p3

    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

    This publication is cited in the following articles:
    1. Yu. L. Vasil'ev, K. L. Rychkov, “A lower bound on formula size of a ternary linear function”, J. Appl. Industr. Math., 7:4 (2013), 588–596  mathnet  crossref  mathscinet
    2. K. L. Rychkov, “Complexity of the realization of a linear Boolean function in the class of $\pi$-schemes”, J. Appl. Industr. Math., 12:3 (2018), 540–576  mathnet  crossref  crossref  elib
    3. K. L. Rychkov, “O sovershennosti minimalnykh pravilnykh razbienii mnozhestva reber $n$-mernogo kuba”, Diskretn. analiz i issled. oper., 26:4 (2019), 74–107  mathnet  crossref
  • Дискретный анализ и исследование операций
    Number of views:
    This page:264
    Full text:59
    References:46
    First page:7

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