Geodesic
Abstract analysis of Korovkin approximation theory [Abstract of thesis]
Commentationes Mathematicae Universitatis Carolinae, Tome 30 (1989) no. 1, pp. 194-195 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 41A36, 41A65 
@article{CMUC_1989_30_1_a26,
     author = {Nos\'alov\'a, A.},
     title = {Abstract analysis of {Korovkin} approximation theory {[Abstract} of thesis]},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     pages = {194--195},
     year = {1989},
     volume = {30},
     number = {1},
     zbl = {0669.41015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMUC_1989_30_1_a26/}
}
TY  - JOUR
AU  - Nosálová, A.
TI  - Abstract analysis of Korovkin approximation theory [Abstract of thesis]
JO  - Commentationes Mathematicae Universitatis Carolinae
PY  - 1989
SP  - 194
EP  - 195
VL  - 30
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/CMUC_1989_30_1_a26/
LA  - en
ID  - CMUC_1989_30_1_a26
ER  - 
%0 Journal Article
%A Nosálová, A.
%T Abstract analysis of Korovkin approximation theory [Abstract of thesis]
%J Commentationes Mathematicae Universitatis Carolinae
%D 1989
%P 194-195
%V 30
%N 1
%U http://geodesic.mathdoc.fr/item/CMUC_1989_30_1_a26/
%G en
%F CMUC_1989_30_1_a26
Nosálová, A. Abstract analysis of Korovkin approximation theory [Abstract of thesis]. Commentationes Mathematicae Universitatis Carolinae, Tome 30 (1989) no. 1, pp. 194-195. http://geodesic.mathdoc.fr/item/CMUC_1989_30_1_a26/

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

[2] Biggs N. L.: Algebraic Graph Theory. Cambridge Univ. Press, 1974. | MR | Zbl

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

[4] Best M. R.: Perfect codes hardly exist. IEEE Trans. Inform. Theory 29 (1983), 349-351. | MR | Zbl

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

[6] Fellows M., Hoover M.: Perfect domination. Tech. Report CS86-7. Dept. of Comp. Sci., Univ. New Mexico, Albuquerque 1987 | Zbl

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

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

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

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

[11] 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. | MR

[12] 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).

[13] Kratochvíl J.: Perfect codes and two-graphs. submitted

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

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