Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
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


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2003, Number 2, Pages 25–28 (Mi vmumm1332)  
Mathematics

Periodic Boolean functions and a lower bound for the complexity of operators

S. N. Preobrazhenskii
Full-text PDF (529 kB)
Received: 25.10.2002
Bibliographic databases:
Document Type: Article
UDC: 519.714.4
Language: Russian
Citation: S. N. Preobrazhenskii, “Periodic Boolean functions and a lower bound for the complexity of operators”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2003, no. 2, 25–28
Citation in format AMSBIB
\Bibitem{Pre03}
\by S.~N.~Preobrazhenskii
\paper Periodic Boolean functions and a lower bound for the complexity of operators
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2003
\issue 2
\pages 25--28
\mathnet{http://mi.mathnet.ru/vmumm1332}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2006665}
\zmath{https://zbmath.org/?q=an:1053.94022}
Linking options:
  • https://www.mathnet.ru/eng/vmumm1332
  • https://www.mathnet.ru/eng/vmumm/y2003/i2/p25
    • 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