Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika. Supplement, 2019, Issue 12, Pages 58–60
DOI: https://doi.org/10.17223/2226308X/12/17 (Mi pdma432) 		 
Discrete Functions

Classes of Boolean functions with limited complexity

A. I. Metalnikovaa, I. A. Pankratova

a Tomsk State University
Full-text PDF (700 kB)
References:
PDF
HTML
DOI: https://doi.org/10.17223/2226308X/12/17
Abstract: The following classes of Boolean functions are considered: with given or limited number of essential variables, of given or limited degree, with given or limited ANF length, having non-repeated ANF. The numbers of functions in the classes and the affiliation tests are given. The algorithm for specifying of a partially defined function to a function of limited degree is presented.
Keywords: essential dependence of a function on a variable, Boolean function degree, algebraic normal form.
Funding agency Grant number
Russian Foundation for Basic Research 17-01-00354_а
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. I. Metalnikova, I. A. Pankratova, “Classes of Boolean functions with limited complexity”, Prikl. Diskr. Mat. Suppl., 2019, no. 12, 58–60
Citation in format AMSBIB
\Bibitem{MetPan19}
\by A.~I.~Metalnikova, I.~A.~Pankratova
\paper Classes of Boolean functions with limited complexity
\jour Prikl. Diskr. Mat. Suppl.
\yr 2019
\issue 12
\pages 58--60
\mathnet{http://mi.mathnet.ru/pdma432}
\crossref{https://doi.org/10.17223/2226308X/12/17}
\elib{https://elibrary.ru/item.asp?id=41153869}
Linking options:
  • https://www.mathnet.ru/eng/pdma432
  • https://www.mathnet.ru/eng/pdma/y2019/i12/p58
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:175
    Full-text PDF :187
    References:13
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024