| On complexity of representation of multiple-valued logic functions as polarised polynomials SN Selezneva Discrete Mathematics and Applications 12 (3), 229-234, 2002 | 15 | 2002 |
| On the complexity of representations of functions over multivalued logics by polarized polynomials SN Selezneva Discrete Mathematics and Applications 14 (2), 48-53, 2002 | 10 | 2002 |
| On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts SN Selezneva Moscow University Computational Mathematics and Cybernetics 38, 64-68, 2014 | 7 | 2014 |
| On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials SN Selezneva Walter de Gruyter, Berlin/New York 7 (6), 565-572, 1997 | 7 | 1997 |
| On the complexity of representation of k-valued functions by generalised polarised polynomials SN Selezneva Walter de Gruyter GmbH & Co. KG 19 (6), 653-663, 2009 | 6 | 2009 |
| Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials SN Selezneva, AV Bukhman Theory of Computing Systems 58, 383-391, 2016 | 5 | 2016 |
| Constructing polynomials for functions over residue rings modulo a composite number in linear time SN Selezneva International Computer Science Symposium in Russia, 302-313, 2012 | 5 | 2012 |
| On the complexity of polarised polynomials of multi-valued logic functions in one variable. SN Selezneva Discrete Mathematics & Applications 14 (3), 2004 | 5 | 2004 |
| Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables SN Selezneva Computational Mathematics and Modeling 24 (1), 146-152, 2013 | 4 | 2013 |
| A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k SN Selezneva Discrete Mathematics and Applications 21 (5-6), 651-674, 2011 | 4 | 2011 |
| On the complexity of generalized polynomials of k-valued functions SN Selezneva, AB Dainyak Moscow University Computational Mathematics and Cybernetics 32 (3), 152-158, 2008 | 4 | 2008 |
| On the complexity of representations of k-valued functions by polarized polynomials VB Alekseev, AA Voronenko, SN Selezneva Proc. of the Int. Workshop on Discrete Mathematics and Mathematical …, 2003 | 4 | 2003 |
| On bijunctive predicates over a finite set SN Selezneva Discrete Mathematics and Applications 29 (1), 49-58, 2019 | 3 | 2019 |
| Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms SN Selezneva Discrete Mathematics and Applications 26 (2), 115-124, 2016 | 3 | 2016 |
| 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 SN Selezneva Walter de Gruyter, Berlin/New York 8 (5), 483-492, 1998 | 3 | 1998 |
| On the complexity of recognizing the completeness of sets of Boolean functions realized by Zhegalkin polynomials SN Selezneva Diskretnaya Matematika 9 (4), 24-31, 1997 | 3 | 1997 |
| Finding periods of Zhegalkin polynomials SN Selezneva Discrete Mathematics and Applications 32 (2), 129-138, 2022 | 2 | 2022 |
| Multiaffine polynomials over a finite field SN Selezneva Discrete Mathematics and Applications 31 (6), 421-430, 2021 | 2 | 2021 |
| On weak positive predicates over a finite set SN Selezneva Discrete Mathematics and Applications 30 (3), 203-213, 2020 | 2 | 2020 |
| On the multiplicative complexity of some Boolean functions SN Selezneva Computational Mathematics and Mathematical Physics 55, 724-730, 2015 | 2 | 2015 |
