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], 2011, Volume 2, Issue 3, Pages 75–98
DOI: https://doi.org/10.4213/mvk37
(Mi mvk37)
 

This article is cited in 1 scientific paper (total in 1 paper)

Universal algebras generated by sets of satisfying vectors of bijunctive and $r$-junctive Boolean functions

A. V. Tarasov

Moscow State Technical University of Radio Engineering, Electronics and Automatics, Moscow
Full-text PDF (222 kB) Citations (1)
References:
Abstract: The notion of universal algebra $\Omega_n^r=(V_n,v_r)$ (where $V_n$ is the set of binary $n$-dimensional vectors and $v_r\colon V_n^{r+1}\to V_n$ is the coordinate-wise operation) is introduced. Subalgebras of this algebra are formed by sets of satisfying vectors for $r$-junctive functions, i.e. functions which may be represented as $r$-CNF. The endomorphisms of these subalgebras of algebra $\Omega_n^r$ and their endomorphic images are described. In the case of $r=2$ several properties of generating systems of the algebra and of some subalgebras are investigated.
Key words: bijunctive functions, $r$-junctive functions, $r$-CNF, universal algebra.
Received 10.V.2011
Document Type: Article
UDC: 519.571
Language: Russian
Citation: A. V. Tarasov, “Universal algebras generated by sets of satisfying vectors of bijunctive and $r$-junctive Boolean functions”, Mat. Vopr. Kriptogr., 2:3 (2011), 75–98
Citation in format AMSBIB
\Bibitem{Tar11}
\by A.~V.~Tarasov
\paper Universal algebras generated by sets of satisfying vectors of bijunctive and $r$-junctive Boolean functions
\jour Mat. Vopr. Kriptogr.
\yr 2011
\vol 2
\issue 3
\pages 75--98
\mathnet{http://mi.mathnet.ru/mvk37}
\crossref{https://doi.org/10.4213/mvk37}
Linking options:
  • https://www.mathnet.ru/eng/mvk37
  • https://doi.org/10.4213/mvk37
  • https://www.mathnet.ru/eng/mvk/v2/i3/p75
  • 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
    Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:495
    Full-text PDF :220
    References:58
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024