|
|
|
Publications in Math-Net.Ru |
Citations |
|
2016 |
| 1. |
A. S. Kazimirov, S. Yu. Reymerov, “On upper bounds of the complexity of functions over non-prime finite fields in some classes of polarized polynomials”, Bulletin of Irkutsk State University. Series Mathematics, 17 (2016), 378–45  |
2
|
| 2. |
A. S. Kazimirov, S. Yu. Reymerov, “Генетический алгоритм синтеза дискретных управляющих систем на базе ПЛМ”, Intelligent systems. Theory and applications, 20:3 (2016), 151–154 |
|
2011 |
| 3. |
A. S. Kazimirov, S. U. Reymerov, “Genetical algorithm obtaining minimal polynomial representations for multi-valued output Boolean functions”, Bulletin of Irkutsk State University. Series Mathematics, 4:4 (2011), 82–86 |
|
2010 |
| 4. |
A. S. Kazimirov, S. Yu. Reymerov, “Computational bound on complexity of polynomial representations of Boolean functions”, Bulletin of Irkutsk State University. Series Mathematics, 3:4 (2010), 33–43   |
1
|
|
| Organisations |
|
|
Contact us: