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., 2013, Volume 20, Number 4, Pages 15–26 (Mi da736)  

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

A lower bound on formula size of a ternary linear function

Yu. L. Vasil'ev, K. L. Rychkov

Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia

Abstract: The formula size of a ternary linear function that depends on $n$ variables is shown to be not less than $n^2+\frac32n-o(n)$. Bibliogr. 8.

Keywords: formula size, $\pi$-scheme, lower bound for the complexity.

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

English version:
Journal of Applied and Industrial Mathematics, 2013, 7:4, 588–596

Bibliographic databases:

UDC: 519.714
Received: 18.03.2013

Citation: Yu. L. Vasil'ev, K. L. Rychkov, “A lower bound on formula size of a ternary linear function”, Diskretn. Anal. Issled. Oper., 20:4 (2013), 15–26; J. Appl. Industr. Math., 7:4 (2013), 588–596

Citation in format AMSBIB
\Bibitem{VasRyc13}
\by Yu.~L.~Vasil'ev, K.~L.~Rychkov
\paper A lower bound on formula size of a~ternary linear function
\jour Diskretn. Anal. Issled. Oper.
\yr 2013
\vol 20
\issue 4
\pages 15--26
\mathnet{http://mi.mathnet.ru/da736}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3114909}
\transl
\jour J. Appl. Industr. Math.
\yr 2013
\vol 7
\issue 4
\pages 588--596
\crossref{https://doi.org/10.1134/S1990478913040133}


Linking options:
  • http://mi.mathnet.ru/eng/da736
  • http://mi.mathnet.ru/eng/da/v20/i4/p15

    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. 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
    2. 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:186
    Full text:55
    References:39
    First page:9

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