| Publication | Date of Publication | Type |
|---|
Universal polynomials of several variables for classes of linear functions
Moscow University Computational Mathematics and Cybernetics | 2024-05-29 | Paper |
The existence of universal polynomials for the class of linear functions in even-valued logics
Moscow University Computational Mathematics and Cybernetics | 2023-11-03 | Paper |
On the universality of product for classes of linear functions of two variables
Discrete Mathematics and Applications | 2023-09-20 | Paper |
Depth of a conditional full diagnostic test for contact circuits implementing a parity counter
Moscow University Computational Mathematics and Cybernetics | 2023-05-25 | Paper |
On a property of linear Boolean functions
Moscow University Computational Mathematics and Cybernetics | 2021-09-21 | Paper |
Universal functions for classes of linear functions of three variables
Computational Mathematics and Modeling | 2021-05-10 | Paper |
| scientific article; zbMATH DE number 7310075 (Why is no real title available?) | 2021-02-15 | Paper |
Universal functions for linear functions depending on two variables
Discrete Mathematics and Applications | 2021-01-08 | Paper |
Conditional testing for Cardot circuits
Moscow University Computational Mathematics and Cybernetics | 2020-11-24 | Paper |
Refining the upper bound for the cardinality of the definition domain of universal functions for a class of linear Boolean functions
Moscow University Computational Mathematics and Cybernetics | 2020-06-23 | Paper |
Universal functions for classes of bilinear and polylinear Boolean functions
Computational Mathematics and Modeling | 2019-02-14 | Paper |
Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions
Discrete Mathematics and Applications | 2018-04-23 | Paper |
Universal functions for classes of Boolean polynomials
Moscow University Computational Mathematics and Cybernetics | 2018-03-20 | Paper |
Existence of universal functions for the class of linear \(k\)-valued functions with moderate \(k\)
Computational Mathematics and Modeling | 2018-03-15 | Paper |
Generation of images of several literals
Computational Mathematics and Modeling | 2018-03-02 | Paper |
On the outcome of false images of linear \(k\)-valued functions for composite numbers \(k\) when the number of variables increases
Moscow University Computational Mathematics and Cybernetics | 2016-09-07 | Paper |
On the Shannon function for read-many certificate length in a family of bases
Moscow University Computational Mathematics and Cybernetics | 2016-04-05 | Paper |
The length of a read-many certificate in the basis of all functions of \(l\) variables
Computational Mathematics and Modeling | 2016-03-21 | Paper |
On the generation of false images of linear \(k\)-valued functions
Computational Mathematics and Modeling | 2016-03-11 | Paper |
On the generation of false images of linear Boolean functions
Moscow University Computational Mathematics and Cybernetics | 2015-11-16 | Paper |
A new proof of Stetsenko's theorem
Moscow University Computational Mathematics and Cybernetics | 2015-03-25 | Paper |
Certificates of Non-Membership for Classes of Read-Once Functions
Fundamenta Informaticae | 2014-12-22 | Paper |
Generation of Boolean functions under the assumption of monotonicity
Moscow University Computational Mathematics and Cybernetics | 2013-08-15 | Paper |
On universal partial functions for a set of linear functions.
Discrete Mathematics and Applications | 2013-04-29 | Paper |
Learning read once functions using subcube parity queries
Computational Mathematics and Modeling | 2012-12-12 | Paper |
Iterated Boolean functions in the elementary basis
Russian Mathematics | 2012-11-20 | Paper |
| Learning read-once functions individually | 2011-07-18 | Paper |
Some test length bounds for nonrepeating functions in the \(\{ \& , \vee \}\) basis
Computational Mathematics and Modeling | 2011-01-10 | Paper |
| scientific article; zbMATH DE number 5827850 (Why is no real title available?) | 2010-12-18 | Paper |
Testing disjunction as a read-once function in an arbitrary unrepeated basis
Moscow University Computational Mathematics and Cybernetics | 2009-11-13 | Paper |
| scientific article; zbMATH DE number 5531167 (Why is no real title available?) | 2009-03-24 | Paper |
On testing repetition-free functions
Moscow University Computational Mathematics and Cybernetics | 2009-01-20 | Paper |
| scientific article; zbMATH DE number 5242388 (Why is no real title available?) | 2008-03-05 | Paper |
Recognizing the nonrepeating property in an arbitrary basis
Computational Mathematics and Modeling | 2007-04-19 | Paper |
| scientific article; zbMATH DE number 5061984 (Why is no real title available?) | 2006-10-10 | Paper |
The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity
Discrete Mathematics and Applications | 2006-10-10 | Paper |
| On a certain approach to the problem of estimating the number of discrete functions | 2006-05-05 | Paper |
Estimating the length of a diagnostic test for some nonrepeating functions
Computational Mathematics and Modeling | 2005-05-23 | Paper |
On the number of closed multidimensional monotone maps
Moscow University Computational Mathematics and Cybernetics | 2004-09-08 | Paper |
On the number of closed extensive mappings
Moscow University Computational Mathematics and Cybernetics | 2004-09-08 | Paper |
Recognizing the presence of a growing unessential argument of Boolean functions
Moscow University Computational Mathematics and Cybernetics | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2095531 (Why is no real title available?) | 2004-08-30 | Paper |
On the number of pseudo-Boolean metric functions
Discrete Mathematics and Applications | 2004-08-30 | Paper |
On the number of multidimensional monotone extensive mappings
Moscow University Computational Mathematics and Cybernetics | 2002-08-01 | Paper |
The growth of number of discrete Lipschitzian functions under growing dimensions of the domain of their definition
Moscow University Mathematics Bulletin | 2001-12-18 | Paper |
On the conditions of complete asymptotics of the power of function classes of \(k\)-valued logic that preserve the finitary predicate
Moscow University Computational Mathematics and Cybernetics | 2000-02-07 | Paper |
On some closed classes in partial two-valued logic
Discrete Mathematics and Applications | 1995-05-22 | Paper |
