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, Ser. 1, 2000, Volume 7, Issue 2, Pages 54–64 (Mi da262)  
This article is cited in 2 scientific papers (total in 2 papers)

Lower bounds for the complexity of symbol sequences defined by symmetric Boolean functions

Yu. V. Merekin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (1116 kB) Citations (2)
Received: 16.12.1999
Bibliographic databases:
UDC: 519.714
Language: Russian
Citation: Yu. V. Merekin, “Lower bounds for the complexity of symbol sequences defined by symmetric Boolean functions”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000), 54–64
Citation in format AMSBIB
\Bibitem{Mer00}
\by Yu.~V.~Merekin
\paper Lower bounds for the complexity of symbol sequences defined by symmetric Boolean functions
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2000
\vol 7
\issue 2
\pages 54--64
\mathnet{http://mi.mathnet.ru/da262}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1778719}
\zmath{https://zbmath.org/?q=an:0956.68118}
Linking options:
  • https://www.mathnet.ru/eng/da262
  • https://www.mathnet.ru/eng/da/v7/s1/i2/p54
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024