Abstract analysis of Korovkin approximation theory [Abstract of thesis]
Nosálová, A.
Commentationes Mathematicae Universitatis Carolinae, Tome 030 (1989), p. 194-195 / Harvested from Czech Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 1989-01-01
Classification:  41A36,  41A65 
@article{106724,
     author = {A. Nos\'alov\'a},
     title = {Abstract analysis of Korovkin approximation theory [Abstract of thesis]},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     volume = {030},
     year = {1989},
     pages = {194-195},
     zbl = {0669.41015},
     language = {en},
     url = {http://dml.mathdoc.fr/item/106724}
}

Nosálová, A. Abstract analysis of Korovkin approximation theory [Abstract of thesis]. Commentationes Mathematicae Universitatis Carolinae, Tome 030 (1989) pp. 194-195. http://gdmltest.u-ga.fr/item/106724/

Angluin D. Local and global properties in networks of processors, Proceedings 12th Annual ACM Symposium on Theory of Computing (1980). (1980)

Biggs N. L. Algebraic Graph Theory, Cambridge Univ. Press, 1974. (1974) | MR 0347649 | Zbl 0284.05101

Biggs N. L. Perfect codes in graphs, J. Combin. Theory Ser. B 15 (1973), 289-296. (1973) | MR 0325457 | Zbl 0256.94009

Best M. R. Perfect codes hardly exist, IEEE Trans. Inform. Theory 29 (1983), 349-351. (1983) | MR 0712395 | Zbl 0517.94013

Dvořáková-Ruličová L. Perfect codes in regular graphs, Comment. Math. Univ. Carolinae 29 (1988), 79-83. (1988) | MR 0937551

Fellows M.; Hoover M. Perfect domination, Tech. Report CS86-7. Dept. of Comp. Sci., Univ. New Mexico, Albuquerque 1987 | Zbl 0761.05091

Hammond P.; Smith.D.H. Perfect codes in the graphs $O_k$, J. Combin. Theory Ser.B 19 (1975), 239-255. (1975) | MR 0414437 | Zbl 0282.94007

Kartochvíl J. Perfect codes over graphs, J. Combin.Theory Ser. B 40 (1986), 224-228. (1986) | MR 0838221

Kratochvíl J. Perfect codes in general graphs, to appear in Proceedings VIIth Hungarian colloqium on combinatorics, Eger 1987 | MR 1141598

Kratochvíl J. One-perfect codes over self-complementary graphs, Comment. Math. Univ. Carolinae 26 (1985), 589-595. (1985) | MR 0817829

Kratochvíl J.; Křivánek M. On the computational complexity of codes in graphs, Proc. MFCS '88, Lecture Notes in Comp. Sci. 324, Springer-Verlag, Berlin (1988), 396-404. (1988) | MR 1023443

Kratochvíl J.; Malý J.; Matoušek J. On the existence of perfect codes in a random graph, to appear in Proceedings Random Graphs '87,Poznań (1987). (1987)

Kratochvíl J. Perfect codes and two-graphs, submitted

Smith D.H. Perfect codes in the graphs $O_k$ and $L(O_k)$, Glasgow Math. J. 21 (1980), 169-172. (1980) | MR 0582126 | Zbl 0432.05048

Tietäväinen A. On the nonexistence of perfect codes over finite fields, SIAM J. Appl. Math. 24 (1973), 88-96. (1973) | MR 0325260