Sibirskii Zhurnal Industrial'noi Matematiki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. Zh. Ind. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Sibirskii Zhurnal Industrial'noi Matematiki, 1998, Volume 1, Number 1, Pages 145–147 (Mi sjim14)  
This article is cited in 1 scientific paper (total in 1 paper)

On the complexity of symbol sequences defined by linear Boolean functions

Yu. V. Merekin
Full-text PDF (191 kB) Citations (1)
Received: 30.04.1998
Bibliographic databases:
UDC: 519.714
Language: Russian
Citation: Yu. V. Merekin, “On the complexity of symbol sequences defined by linear Boolean functions”, Sib. Zh. Ind. Mat., 1:1 (1998), 145–147
Citation in format AMSBIB
\Bibitem{Mer98}
\by Yu.~V.~Merekin
\paper On the complexity of symbol sequences defined by linear Boolean functions
\jour Sib. Zh. Ind. Mat.
\yr 1998
\vol 1
\issue 1
\pages 145--147
\mathnet{http://mi.mathnet.ru/sjim14}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1786598}
\zmath{https://zbmath.org/?q=an:0936.68080}
Linking options:
  • https://www.mathnet.ru/eng/sjim14
  • https://www.mathnet.ru/eng/sjim/v1/i1/p145
    • This publication is cited in the following 1 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