%0 Journal Article
%A V. A. Buevich
%A M. A. Podkolzina
%T On algorithmic solvability of the $A$-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate $S$-functions
%J Diskretnaya Matematika
%D 2012
%P 56-69
%V 24
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2012_24_4_a4/
%G ru
%F DM_2012_24_4_a4