|
|
|
Publications in Math-Net.Ru |
Citations |
|
2012 |
| 1. |
V. A. Buevich, M. A. Podkolzina, “On algorithmic solvability of the $A$-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate $S$-functions”, Diskr. Mat., 24:4 (2012), 56–69    ; Discrete Math. Appl., 22:5-6 (2012), 555–569 |
|
2009 |
| 2. |
M. A. Podkolzina, “On completeness and $A$-completeness of $S$-sets of determinate functions containing all one-place determinate $S$-functions”, Diskr. Mat., 21:2 (2009), 75–87 ; Discrete Math. Appl., 19:3 (2009), 263–276  |
1
|
| 3. |
M. A. Podkolzina, “The number of $\mathrm{S}$-precomplete classes in the functional system $P_k^\tau$”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2009, no. 1, 61–62 |
|
2008 |
| 4. |
V. A. Buevich, M. A. Podkolzina, “A problem of completeness of $\mathrm{S}$-sets of deterministic functions”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2008, no. 5, 57–59  |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: