|
|
|
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 |
|
2008 |
| 2. |
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  |
|
2000 |
| 3. |
V. A. Buevich, “The completeness criterion for systems containing all one-place bounded-determinate functions”, Diskr. Mat., 12:4 (2000), 138–158 ; Discrete Math. Appl., 10:6 (2000), 613–634 |
1
|
|
1996 |
| 4. |
V. A. Buevich, “A variant of the proof of a completeness criterion for functions of $k$-valued logic”, Diskr. Mat., 8:4 (1996), 11–36 ; Discrete Math. Appl., 6:5 (1996), 505–530 |
2
|
|
1992 |
| 5. |
V. A. Buevich, “On $\tau$-completeness in the class of determinate functions”, Dokl. Akad. Nauk, 326:3 (1992), 399–403 ; Dokl. Math., 46:2 (1993), 264–268 |
1
|
|
1980 |
| 6. |
V. A. Buevich, “On $\tau$-completeness in the class of automata mappings”, Dokl. Akad. Nauk SSSR, 252:5 (1980), 1037–1041 |
1
|
|
1972 |
| 7. |
V. A. Buevich, “On the algorithmic undecidability of $A$-completeness for the boundedly determinate functions”, Mat. Zametki, 11:6 (1972), 687–697 ; Math. Notes, 11:6 (1972), 417–421 |
8
|
| |
|
|
Contact us: