RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Selezneva Svetlana Nikolaevna

Statistics Math-Net.Ru
Total publications: 18
Scientific articles: 18

Number of views:
This page:699
Abstract pages:3620
Full texts:911
References:325
Associate professor
Candidate of physico-mathematical sciences
E-mail:

http://www.mathnet.ru/eng/person27907
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/635382

Publications in Math-Net.Ru
1. On weakly positive predicates over finite set
S. N. Selezneva
Diskr. Mat., 30:3 (2018),  127–140
2. О биюнктивных предикатах над конечным множеством
S. N. Selezneva
Diskr. Mat., 29:4 (2017),  130–142
3. Upper bound for the length of functions over a finite field in the class of pseudopolynomials
S. N. Selezneva
Zh. Vychisl. Mat. Mat. Fiz., 57:5 (2017),  899–904
4. On the number of functions of $k$-valued logic which are polynomials modulo composite $k$
S. N. Selezneva
Diskr. Mat., 28:2 (2016),  81–91
5. Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
Svetlana N. Selezneva
Diskr. Mat., 27:1 (2015),  111–122
6. On the multiplicative complexity of some Boolean functions
S. N. Selezneva
Zh. Vychisl. Mat. Mat. Fiz., 55:4 (2015),  730–736
7. Multiplicative complexity of some Boolean functions
S. N. Selezneva
Diskr. Mat., 26:4 (2014),  100–109
8. On the length of functions of $k$-valued logic in the class of polynomial normal forms modulo $k$
M. A. Bashov, S. N. Selezneva
Diskr. Mat., 26:3 (2014),  3–9
9. A fast algorithm for the construction of polynomials modulo $k$ for $k$-valued functions for composite $k$
S. N. Selezneva
Diskr. Mat., 23:3 (2011),  3–22
10. On the complexity of representation of $k$-valued functions by generalised polarised polynomials
S. N. Selezneva
Diskr. Mat., 21:4 (2009),  20–29
11. Fast Algorithm for Building Polarized Polynomial Coefficients' Vectors of $k$-valued Functions
S. N. Selezneva, N. K. Markelov
Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  147–153
12. On approximation with given accuracy of functions of $k$-valued logic by polynomials
S. N. Selezneva
Diskr. Mat., 20:2 (2008),  32–45
13. On the complexity of polarized polynomials of functions of many-valued logics that depend on one variable
S. N. Selezneva
Diskr. Mat., 16:2 (2004),  117–120
14. On the complexity of the representation of functions of many-valued logics by polarized polynomials
S. N. Selezneva
Diskr. Mat., 14:2 (2002),  48–53
15. Magnetic coherence transfer induced by discharge radiation and the effect of radiation trapping on the lifetime of the hidden alignment of Ne terms
È. G. Saprykin, S. N. Selezneva, V. A. Sorokin
Pis'ma v Zh. Èksper. Teoret. Fiz., 76:5 (2002),  322–327
16. On some properties of polynomials over finite fields
S. N. Selezneva
Diskr. Mat., 13:2 (2001),  111–119
17. A polynomial algorithm for recognizing the membership of a function of $k$-valued logic realized by a polynomial in precomplete classes of self-dual functions
S. N. Selezneva
Diskr. Mat., 10:3 (1998),  64–72
18. On the complexity of recognizing the completeness of sets of Boolean functions realized by Zhegalkin polynomials
S. N. Selezneva
Diskr. Mat., 9:4 (1997),  24–31

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018