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., 2012, Volume 24, Issue 4,Pages 56

JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 2012 Volume 24, Issue 4, Pages 56–69 (Mi dm1210)

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

UDC: 519.7

Received: 22.12.2011

DOI: 10.4213/dm1210

Fulltext: PDF file (168 kB)
References

English version: Discrete Mathematics and Applications, 2012, 22:5-6, 555–569

Bibliographic databases: