|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
A. V. Bistrigova, “Using comparation queries in exact learning of Post closed classes”, Intelligent systems. Theory and applications, 26:3 (2022), 88–108  |
1
|
|
2021 |
| 2. |
A. V. Bistrigova, “Learning of bounded-weight Boolean functions”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 6, 14–20   ; Moscow University Mathematics Bulletin, 76:6 (2021), 251–258 |
1
|
|
2020 |
| 3. |
A. V. Bistrigova, “Learning of Boolean fixed-weight functions”, Intelligent systems. Theory and applications, 24:3 (2020), 63–97 |
2
|
|
2019 |
| 4. |
A. V. Bistrigova, “Attribute-efficient learning of Boolean functions from Post closed classes”, Diskr. Mat., 31:2 (2019), 34–56  ; Discrete Math. Appl., 30:5 (2020), 285–301   |
6
|
| 5. |
A. V. Bistrigova, “Using comparation queries in attribute-efficient learning of Boolean functions”, Intelligent systems. Theory and applications, 23:4 (2019), 115–124 |
2
|
|
2018 |
| 6. |
A. V. Bistrigova, “Letter to the editor concerning the paper by Z. A. Niyazova “Learning of arithmetic sum of monotone conjunctions””, Intelligent systems. Theory and applications, 22:4 (2018), 107–110 |
|
2016 |
| 7. |
A. V. Bistrigova, “Attribute-efficient learning functions of k-valued logic”, Intelligent systems. Theory and applications, 20:2 (2016), 121–146 |
4
|
|
2015 |
| 8. |
A. V. Bistrigova, “Complexity of learning linear boolean functions”, Intelligent systems. Theory and applications, 19:3 (2015), 101–126 |
|
| Organisations |
|
|
