| Publication | Date of Publication | Type |
|---|
Deciding multiaffinity of polynomials over a finite field
Discrete Mathematics and Applications | 2024-09-06 | Paper |
Checking the polynomiality of single-variable functions of \({k}\)-valued logic composite modulo \({k}\)
Moscow University Computational Mathematics and Cybernetics | 2024-07-16 | Paper |
On properties of multiaffine predicates on a finite set
Discrete Mathematics and Applications | 2023-09-20 | Paper |
On complexity of searching for periods of functions given by polynomials over a prime field
Diskretnyi analiz i issledovanie operatsii | 2023-02-21 | Paper |
Finding periods of Zhegalkin polynomials
Discrete Mathematics and Applications | 2022-10-06 | Paper |
Multiaffinity testing of Boolean functions using their Zhegalkin polynomials
Moscow University Computational Mathematics and Cybernetics | 2022-06-09 | Paper |
Multiaffine polynomials over a finite field
Discrete Mathematics and Applications | 2022-01-05 | Paper |
On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
The Bulletin of Irkutsk State University. Series Mathematics | 2020-12-11 | Paper |
On weak positive predicates over a finite set
Discrete Mathematics and Applications | 2020-07-30 | Paper |
Coloring of pseudocubic graphs in three colors
Moscow University Computational Mathematics and Cybernetics | 2020-01-23 | Paper |
On \(m\)-junctive predicates on a finite set
Journal of Applied and Industrial Mathematics | 2019-12-02 | Paper |
On bijunctive predicates over a finite set
Discrete Mathematics and Applications | 2019-05-03 | Paper |
Complexity of function systems over a finite field in the class of polarized polynomial forms
Moscow University Computational Mathematics and Cybernetics | 2018-03-02 | Paper |
Complexity of the satisfiability problem for multilinear forms over a finite field
Moscow University Computational Mathematics and Cybernetics | 2018-02-14 | Paper |
On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\)
Discrete Mathematics and Applications | 2017-11-02 | Paper |
Upper bound for the length of functions over a finite field in the class of pseudopolynomials
Computational Mathematics and Mathematical Physics | 2017-08-31 | Paper |
On the multiplicative complexity of Boolean functions
Fundamenta Informaticae | 2017-07-28 | Paper |
Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
Moscow University Computational Mathematics and Cybernetics | 2016-11-22 | Paper |
Multiplicative complexity of some Boolean functions
Discrete Mathematics and Applications | 2016-09-13 | Paper |
On the length of functions of \(k\)-valued logic in the class of polynomial normal forms modulo \(k\)
Discrete Mathematics and Applications | 2016-09-13 | Paper |
Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
Discrete Mathematics and Applications | 2016-09-13 | Paper |
Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials
Theory of Computing Systems | 2016-05-19 | Paper |
Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
Computational Mathematics and Modeling | 2015-12-03 | Paper |
On algorithmic complexity of finding the residue of division by a power of 2 of the weight of a Boolean function defined by a polynomial
Moscow University Computational Mathematics and Cybernetics | 2015-09-04 | Paper |
On the multiplicative complexity of quasi-quadratic Boolean functions
Moscow University Computational Mathematics and Cybernetics | 2015-07-30 | Paper |
On the multiplicative complexity of some Boolean functions
Computational Mathematics and Mathematical Physics | 2015-07-13 | Paper |
On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
Moscow University Computational Mathematics and Cybernetics | 2015-03-25 | Paper |
The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear
Moscow University Computational Mathematics and Cybernetics | 2013-08-15 | Paper |
A fast algorithm for the construction of polynomials modulo \(k\) for \(k\)-valued functions for composite \(k\)
Discrete Mathematics and Applications | 2013-04-29 | Paper |
Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
Computer Science – Theory and Applications | 2012-09-10 | Paper |
On the complexity of representation of \(k\)-valued functions by generalised polarised polynomials
Discrete Mathematics and Applications | 2012-03-23 | Paper |
| Fast algorithm for constructing polarized polynomial coefficient vectors of \(k\)-valued functions | 2011-07-18 | Paper |
On approximation with given accuracy of functions of k-valued logic by polynomials
Discrete Mathematics and Applications | 2009-10-21 | Paper |
On the complexity of generalized polynomials of \(k\)-valued functions
Moscow University Computational Mathematics and Cybernetics | 2009-01-26 | Paper |
On the complexity of polarised polynomials of multi-valued logic functions in one variable
Discrete Mathematics and Applications | 2004-10-27 | Paper |
On complexity of representation of multiple-valued logic functions as polarised polynomials
Discrete Mathematics and Applications | 2004-08-30 | Paper |
On some properties of polynomials over finite fields
Discrete Mathematics and Applications | 2004-08-30 | Paper |
| scientific article; zbMATH DE number 1873297 (Why is no real title available?) | 2003-02-24 | Paper |
On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials
Discrete Mathematics and Applications | 2001-08-16 | Paper |
A polynomial algorithm for the recognition of belonging a function of k-valued logic realized by a polynomial to precomplete classes of self-dual functions
Discrete Mathematics and Applications | 2001-01-04 | Paper |
