Algebra i logika
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


Algebra Logika:
Year:
Volume:
Issue:
Page:
Find




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

Algebra i logika, 1995, Volume 34, Number 3, Pages 323–326 (Mi al2310)  
This article is cited in 24 scientific papers (total in 24 papers)

Complexity of Boolean functions in a class of polynomial polarized forms

N. A. Peryazev
Full-text PDF (321 kB) Citations (24)
Received: 02.03.1994
English version:
Algebra and Logic
DOI: https://doi.org/10.1007/BF02341875
Bibliographic databases:
Document Type: Article
UDC: 519.713
Language: Russian
Citation: N. A. Peryazev, “Complexity of Boolean functions in a class of polynomial polarized forms”, Algebra Logika, 34:3 (1995), 323–326
Citation in format AMSBIB
\Bibitem{Per95}
\by N.~A.~Peryazev
\paper Complexity of Boolean functions in a class of polynomial
polarized forms
\jour Algebra Logika
\yr 1995
\vol 34
\issue 3
\pages 323--326
\mathnet{http://mi.mathnet.ru/al2310}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1364470}
Linking options:
  • https://www.mathnet.ru/eng/al2310
  • https://www.mathnet.ru/eng/al/v34/i3/p323
    • This publication is cited in the following 24 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:33
    Full-text PDF :15
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024