|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
A. A. Voronenko, “On the universality of product for classes of linear functions of two variables”, Diskr. Mat., 34:1 (2022), 20–22  ; Discrete Math. Appl., 33:4 (2023), 269–271 |
1
|
|
2021 |
| 2. |
A. A. Voronenko, D. V. Kaftan, “Testing read-once functions in the elementary basis augmented with all weakly read-multiple unate functions”, Intelligent systems. Theory and applications, 25:3 (2021), 75–82 |
|
2020 |
| 3. |
A. A. Voronenko, A. S. Okuneva, “Universal functions for linear functions depending on two variables”, Diskr. Mat., 32:1 (2020), 3–7  ; Discrete Math. Appl., 30:5 (2020), 353–356   |
2
|
|
2016 |
| 4. |
A. A. Voronenko, M. N. Vyalyi, “Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions”, Diskr. Mat., 28:4 (2016), 50–57  ; Discrete Math. Appl., 27:5 (2017), 319–324 |
3
|
| 5. |
E. S. Malakhova, A. A. Voronenko, “Тестирование схем Кардо малого числа переменных”, Intelligent systems. Theory and applications, 20:3 (2016), 37–40 |
|
2012 |
| 6. |
A. A. Voronenko, “On universal functions for the set of linear functions”, Diskr. Mat., 24:3 (2012), 62–65 ; Discrete Math. Appl., 22:4 (2012), 421–425 |
14
|
|
2011 |
| 7. |
A. A. Voronenko, V. S. Fedorova, D. V. Chistikov, “Iterated Boolean functions in the elementary basis”, Izv. Vyssh. Uchebn. Zaved. Mat., 2011, no. 11, 72–77 ; Russian Math. (Iz. VUZ), 55:11 (2011), 61–65 |
3
|
| 8. |
A. A. Voronenko, “On the complexity of proving that a Boolean function is not a binary read-once”, Prikl. Diskr. Mat., 2011, no. 3(13), 12–16 |
3
|
|
2009 |
| 9. |
A. A. Voronenko, D. V. Chistikov, “Learning Read-Once Functions Individually”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009), 36–44 |
|
2005 |
| 10. |
A. A. Voronenko, “The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity”, Diskr. Mat., 17:4 (2005), 111–115  ; Discrete Math. Appl., 15:5 (2005), 507–511 |
| 11. |
A. A. Voronenko, “On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$”, Diskr. Mat., 17:2 (2005), 139–143 ; Discrete Math. Appl., 15:3 (2005), 313–318 |
8
|
|
2002 |
| 12. |
A. A. Voronenko, “On a decomposition method for recognizing membership in invariant classes”, Diskr. Mat., 14:4 (2002), 110–116 ; Discrete Math. Appl., 12:6 (2002), 607–614 |
5
|
|
2001 |
| 13. |
A. A. Voronenko, “On the number of metric functions of a Boolean cube”, Diskr. Mat., 13:4 (2001), 116–121 ; Discrete Math. Appl., 11:6 (2001), 643–648 |
|
2000 |
| 14. |
A. A. Voronenko, “On the growth of the number of discrete Lipschitzian functions when the dimension of the domain increases”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2000, no. 2, 3–7 |
1
|
|
1994 |
| 15. |
V. B. Alekseev, L. L. Voronenko, “On some closed classes in partial two-valued logic”, Diskr. Mat., 6:4 (1994), 58–79 ; Discrete Math. Appl., 4:5 (1994), 401–419 |
17
|
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: