Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
From MaRDI portal
Publication:344027
DOI10.3103/S0278641916030043zbMATH Open1351.94098OpenAlexW4238995141MaRDI QIDQ344027FDOQ344027
Authors: Svetlana N. Selezneva 
Publication date: 22 November 2016
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s0278641916030043
Recommendations
- On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
- On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
- Upper bound for the length of functions over a finite field in the class of pseudopolynomials
- On complexity of a particular Boolean functions class
- Multiplicative complexity of some Boolean functions
Boolean functionlengthupper boundexclusive-OR sum of pseudoproductsmultiaffine functionpolynomial formZhegalkin polynomial
Cites Work
- Asymmetric binary covering codes.
- Complexity of Boolean functions in the class of polarized polynomial forms
- Complexity of Boolean functions in the class of canonical polarized polynomials
- An upper bound for complexity of polynomial normal forms of Boolean functions
- On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
Cited In (5)
- On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
- On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
- A conjecture about sums of disjoint products
- Upper bound for the length of functions over a finite field in the class of pseudopolynomials
- Title not available (Why is that?)
This page was built for publication: Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344027)
