|
|
|
Publications in Math-Net.Ru |
Citations |
|
2018 |
| 1. |
S. P. Gorshkov, A. V. Tarasov, “On the weights of Boolean functions representable by $2$-CNF or $3$-CNF”, Mat. Vopr. Kriptogr., 9:1 (2018), 5–26   |
2
|
|
2016 |
| 2. |
S. P. Gorshkov, “Investigation of some subclasses of multiaffine, bijunctive, weakly positive and weakly negative Boolean functions”, Mat. Vopr. Kriptogr., 7:4 (2016), 51–66  |
|
2015 |
| 3. |
S. P. Gorshkov, “Functions from Schaefer classes having negations belonging to other Schaefer classes”, Mat. Vopr. Kriptogr., 6:4 (2015), 23–48 |
|
2013 |
| 4. |
S. P. Gorshkov, A. V. Dvinyaninov, “Lower and upper bounds for the affinity order of transformations of Boolean vector spaces”, Prikl. Diskr. Mat., 2013, no. 2(20), 14–18 |
7
|
| 5. |
S. P. Gorshkov, “About some properties of Horn and anti-Horn functions”, Prikl. Diskr. Mat., 2013, no. 2(20), 5–13 |
1
|
|
2009 |
| 6. |
S. P. Gorshkov, A. V. Tarasov, “Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions”, Diskr. Mat., 21:2 (2009), 94–101 ; Discrete Math. Appl., 19:3 (2009), 283–291  |
5
|
|
2008 |
| 7. |
S. P. Gorshkov, “On the complexity of weakly positive and weakly negative boolean functions reducing”, Prikl. Diskr. Mat., 2008, no. 1(1), 7–9 |
1
|
|
1996 |
| 8. |
S. P. Gorshkov, “On the complexity of the problem of determining the number of solutions of systems of Boolean equations”, Diskr. Mat., 8:1 (1996), 72–85  ; Discrete Math. Appl., 6:1 (1996), 77–92 |
5
|
|
|
|
2020 |
| 9. |
G. V. Balakin, S. M. Buravlev, S. P. Gorshkov, A. M. Zubkov, G. I. Ivchenko, A. V. Knyazev, A. P. Kovalenko, O. A. Kozlitin, V. A. Kopyttsev, A. V. Lapshin, D. V. Matyukhin, Yu. I. Medvedev, V. G. Mikhailov, A. V. Mikhalev, Yu. V. Nesterenko, A. B. Pichkur, B. A. Pogorelov, V. N. Sachkov, A. V. Tarasov, I. G. Shaposhnikov, V. A. Shishkin, A. M. Shoitov, “To the memory of Igor Aleksandrovich Kruglov”, Mat. Vopr. Kriptogr., 11:4 (2020), 5–6 |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: