|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
K. L. Rychkov, “On the structure of one class of perfect $\Pi$-partitions”, Sib. Èlektron. Mat. Izv., 20:2 (2023), 1499–1518  |
|
2022 |
| 2. |
K. L. Rychkov, “Representations of normalized formulas”, Diskretn. Anal. Issled. Oper., 29:4 (2022), 77–103  |
1
|
|
2019 |
| 3. |
K. L. Rychkov, “On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube”, Diskretn. Anal. Issled. Oper., 26:4 (2019), 74–107 |
3
|
|
2018 |
| 4. |
K. L. Rychkov, “Complexity of the realization of a linear Boolean function in the class of $\pi$-schemes”, Diskretn. Anal. Issled. Oper., 25:3 (2018), 36–94  ; J. Appl. Industr. Math., 12:3 (2018), 540–576  |
3
|
|
2015 |
| 5. |
K. L. Rychkov, “Sufficient conditions for the minimal $\pi$-schemes for linear Boolean functions to be locally non-repeating”, Diskretn. Anal. Issled. Oper., 22:5 (2015), 71–85 ; J. Appl. Industr. Math., 9:4 (2015), 580–587 |
4
|
|
2014 |
| 6. |
K. L. Rychkov, “Lower bounds on the formula complexity of a linear Boolean function”, Sib. Èlektron. Mat. Izv., 11 (2014), 165–184 |
4
|
|
2013 |
| 7. |
Yu. L. Vasil'ev, K. L. Rychkov, “A lower bound on formula size of a ternary linear function”, Diskretn. Anal. Issled. Oper., 20:4 (2013), 15–26 ; J. Appl. Industr. Math., 7:4 (2013), 588–596 |
4
|
|
2012 |
| 8. |
S. V. Avgustinovich, Yu. L. Vasil'ev, K. L. Rychkov, “The computation complexity in the class of formulas”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 3–12 ; J. Appl. Industr. Math., 6:4 (2012), 403–409 |
5
|
|
2010 |
| 9. |
K. L. Rychkov, “A lower bound for the complexity of generalized parallel-serial contact circuits for a characteristic function of divisibility by $q$”, Diskretn. Anal. Issled. Oper., 17:6 (2010), 68–76  |
2
|
|
2009 |
| 10. |
K. L. Rychkov, “On the complexity of generalized contact circuits”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 78–87 |
4
|
|
2007 |
| 11. |
K. L. Rychkov, “Об условиях существования графа с заданными диаметром, числом вершинной связности и вектором разнообразия шаров”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:4 (2007), 43–56 ; J. Appl. Industr. Math., 3:1 (2009), 107–116 |
2
|
|
2006 |
| 12. |
K. L. Rychkov, “Sufficient conditions for the existence of a graph with a given variety of balls”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006), 99–108 ; J. Appl. Industr. Math., 1:3 (2007), 380–385 |
7
|
|
2002 |
| 13. |
K. L. Rychkov, “On a relation between lower bounds for the complexity of schemes of functional elements and the minimal covering problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002), 54–58 |
|
1994 |
| 14. |
K. L. Rychkov, “Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions”, Sibirsk. Zh. Issled. Oper., 1:4 (1994), 33–52 |
8
|
|
|
|
2013 |
| 15. |
P. E. Alaev, O. V. Bogopolski, A. V. Vasil'ev, S. S. Goncharov, Yu. L. Ershov, V. D. Mazurov, L. L. Maksimova, A. S. Morozov, S. P. Odintsov, D. E. Palchunov, V. G. Puzarenko, V. V. Rybakov, K. L. Rychkov, A. N. Ryaskin, I. A. Taimanov, A. S. Filyurin, D. G. Khramtsov, V. A. Churkin, “Sergei Ilyich Mardaev (6.04.1962–10.04.2013)”, Sib. Èlektron. Mat. Izv., 10 (2013), 30–34 |
|
| Organisations |
|
| |
|
|
Contact us: