|
On algorithmic solvability of the $A$-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate $S$-functions
V. A. Buevich, M. A. Podkolzina
Received: 22.12.2011
Citation:
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
Linking options:
https://www.mathnet.ru/eng/dm1210https://doi.org/10.4213/dm1210 https://www.mathnet.ru/eng/dm/v24/i4/p56
|
Statistics & downloads: |
Abstract page: | 339 | Full-text PDF : | 169 | References: | 47 | First page: | 22 |
|