Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
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



Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find






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


Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2018, Volume 9, Issue 1, Pages 5–26
DOI: https://doi.org/10.4213/mvk242
(Mi mvk242)
 

This article is cited in 2 scientific papers (total in 2 papers)

On the weights of Boolean functions representable by $2$-CNF or $3$-CNF

S. P. Gorshkova, A. V. Tarasovb

a Academy of Cryptography of the Russian Federation, Moscow
b Moscow State University of Information Technologies, Radioengineering and Electronics, Moscow
Full-text PDF (215 kB) Citations (2)
References:
Abstract: Sets of possible values of weights of bijunctive Boolean functions ($2$-CNF) are found. For Boolean functions having all variables as essential ones we describe: sets of bijunctive functions with weight close (but not equal) to the maximal value and sets of functions of maximal weight represented as $3$-CNF. A hypothesis on the maximal weight of functions representable as $k$-CNF ($k \geqslant 4$) and having all variables as essential ones is formulated. Some sets of balanced Boolean functions representable as $k$-CNF are described.
Key words: weight of Boolean function, bijunctive Boolean functions, $k$-CNF.
Received 11.V.2017
Bibliographic databases:
Document Type: Article
UDC: 519.716.5
Language: Russian
Citation: S. P. Gorshkov, A. V. Tarasov, “On the weights of Boolean functions representable by $2$-CNF or $3$-CNF”, Mat. Vopr. Kriptogr., 9:1 (2018), 5–26
Citation in format AMSBIB
\Bibitem{GorTar18}
\by S.~P.~Gorshkov, A.~V.~Tarasov
\paper On the weights of Boolean functions representable by $2$-CNF or $3$-CNF
\jour Mat. Vopr. Kriptogr.
\yr 2018
\vol 9
\issue 1
\pages 5--26
\mathnet{http://mi.mathnet.ru/mvk242}
\crossref{https://doi.org/10.4213/mvk242}
\elib{https://elibrary.ru/item.asp?id=32810558}
Linking options:
  • https://www.mathnet.ru/eng/mvk242
  • https://doi.org/10.4213/mvk242
  • https://www.mathnet.ru/eng/mvk/v9/i1/p5
  • 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