The algebraic closure of a family of separated algorithms
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 1, pp. 198-205
Cet article a éte moissonné depuis la source Math-Net.Ru
The equivalence of the algebraic closure of a system of separating recognition algorithms and a set of polynomial decision rules in a natural rectifying space is established. The conditions for the correctness of the algebraic closure are found.
@article{ZVMMF_1983_23_1_a22,
author = {A. S. Dzyuba},
title = {The algebraic closure of a family of separated algorithms},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {198--205},
year = {1983},
volume = {23},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_1_a22/}
}
A. S. Dzyuba. The algebraic closure of a family of separated algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 1, pp. 198-205. http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_1_a22/