Geodesic
Learning Read-Once Functions Individually
Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki, Tome 151 (2009) no. 2, pp. 36-44
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

The paper considers special properties of graphs linked to read-once functions and the task of learning them individually. A main theorem characterizing the set of all checking tests is proved; the results are applied to the problem of learning with respect to read-once alternatives in the basis of all two-variable functions. Individual upper bounds for minimal test length are obtained and a sequence of easily learned functions is constructed.
Keywords: read-once functions, tests, learning, read-once alternative, individual learning, disconnected graph. 
@article{UZKU_2009_151_2_a4,
     author = {A. A. Voronenko and D. V. Chistikov},
     title = {Learning {Read-Once} {Functions} {Individually}},
     journal = {U\v{c}\"enye zapiski Kazanskogo universiteta. Seri\^a Fiziko-matemati\v{c}eskie nauki},
     pages = {36--44},
     year = {2009},
     volume = {151},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/UZKU_2009_151_2_a4/}
}
TY  - JOUR
AU  - A. A. Voronenko
AU  - D. V. Chistikov
TI  - Learning Read-Once Functions Individually
JO  - Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
PY  - 2009
SP  - 36
EP  - 44
VL  - 151
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/UZKU_2009_151_2_a4/
LA  - ru
ID  - UZKU_2009_151_2_a4
ER  - 
%0 Journal Article
%A A. A. Voronenko
%A D. V. Chistikov
%T Learning Read-Once Functions Individually
%J Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
%D 2009
%P 36-44
%V 151
%N 2
%U http://geodesic.mathdoc.fr/item/UZKU_2009_151_2_a4/
%G ru
%F UZKU_2009_151_2_a4
A. A. Voronenko; D. V. Chistikov. Learning Read-Once Functions Individually. Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki, Tome 151 (2009) no. 2, pp. 36-44. http://geodesic.mathdoc.fr/item/UZKU_2009_151_2_a4/

[1] Voronenko A. A., “O proveryayuschikh testakh dlya bespovtornykh funktsii”, Matem. vopr. kibernetiki, 11, Fizmatlit, M., 2002, 163–176 | MR

[2] Gurvich V. A., “O bespovtornykh bulevykh funktsiyakh”, Usp. matem. nauk, 32:1 (1977), 183–184 | MR | Zbl

[3] Gurvich V. A., “Kriterii bespovtornosti funktsii algebry logiki”, Dokl. AN SSSR, 318:3 (1991), 532–537 | MR | Zbl

[4] Golumbic M. C., Mintz A., Rotics U., “Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial $k$-trees”, Discrete Appl. Math., 154 (2006), 1465–1677 | DOI | MR

[5] Voronenko A. A., “Ob otsenke dliny proveryayuschego testa dlya nekotorykh bespovtornykh funktsii”, Prikl. matem. i inform., 15, Maks Press, M., 2003, 85–97

[6] Voronenko A. A., Metody predstavleniya diskretnykh funktsii v zadachakh podscheta, testirovaniya i raspoznavaniya svoistv, Dis. $\dots$ d-ra fiz.-mat. nauk, M., 2007, 154 pp.

[7] Ryabets L. V., Slozhnost proveryayuschikh testov dlya bespovtornykh bulevykh funktsii, Diskretnaya matematika i informatika, 18, Izd-vo Irk. gos. ped. un-ta, Irkutsk, 2007, 30 pp.