Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
E-mail:
Keywords: discrete function, polynomial, graph, algorithm, complexity
UDC: 519.7

Subject:

Discrete Mathematics

Main publications:

1. Selezneva S.N., “Verkhnyaya otsenka dliny funktsii nad konechnym polem v klasse psevdopolinomov”, Zhurnal vychislitelnoi matematiki i matematicheskoi fiziki, 57:5 (2017), 899-904
2. Selezneva S.N., “O chisle polinomialnykh funktsii k-znachnoi logiki po sostavnomu modulyu k”, Diskretnaya matematika, 28:2 (2016), 81-91
3. Selezneva S.N., “Constructing polynomials for functions over residue rings modulo a composite number in linear time”, Lecture Notes in Computer Science, 7353 (2012), 303-312
4. Selezneva S.N., “O nekotorykh svoistvakh mnogochlenov nad konechnym polem”, Diskretnaya matematika, 13:2 (2001), 111-119
5. Selezneva S.N., “O slozhnosti raspoznavaniya polnoty mnozhestv bulevykh funktsii, realizovannykh polinomami Zhegalkina”, Diskretnaya matematika, 9:4 (1997), 24-31

Publications in Math-Net.Ru

Personal pages:

• 
• 
• 
• ISTINA
• 
• 
• 

Organisations:

• Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics