Abstract analysis of Korovkin approximation theory [Abstract of thesis]

A. Nosálová

Commentationes Mathematicae Universitatis Carolinae (1989)

  • Volume: 030, Issue: 1, page 194-195
  • ISSN: 0010-2628

How to cite

top

Nosálová, A.. "Abstract analysis of Korovkin approximation theory [Abstract of thesis]." Commentationes Mathematicae Universitatis Carolinae 030.1 (1989): 194-195. <http://eudml.org/doc/17718>.

@article{Nosálová1989,
author = {Nosálová, A.},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {Korovkin approximation theory; Korovkin set; separable Banach lattice; Korovkin family},
language = {eng},
number = {1},
pages = {194-195},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Abstract analysis of Korovkin approximation theory [Abstract of thesis]},
url = {http://eudml.org/doc/17718},
volume = {030},
year = {1989},
}

TY - JOUR
AU - Nosálová, A.
TI - Abstract analysis of Korovkin approximation theory [Abstract of thesis]
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1989
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 030
IS - 1
SP - 194
EP - 195
LA - eng
KW - Korovkin approximation theory; Korovkin set; separable Banach lattice; Korovkin family
UR - http://eudml.org/doc/17718
ER -

References

top
  1. Angluin D., Local and global properties in networks of processors, Proceedings 12th Annual ACM Symposium on Theory of Computing (1980). (1980) 
  2. Biggs N. L., Algebraic Graph Theory, Cambridge Univ. Press, 1974. (1974) Zbl0284.05101MR0347649
  3. Biggs N. L., Perfect codes in graphs, J. Combin. Theory Ser. B 15 (1973), 289-296. (1973) Zbl0256.94009MR0325457
  4. Best M. R., Perfect codes hardly exist, IEEE Trans. Inform. Theory 29 (1983), 349-351. (1983) Zbl0517.94013MR0712395
  5. Dvořáková-Ruličová L., Perfect codes in regular graphs, Comment. Math. Univ. Carolinae 29 (1988), 79-83. (1988) Zbl0691.05054MR0937551
  6. Fellows M., Hoover M., Perfect domination, Tech. Report CS86-7. Dept. of Comp. Sci., Univ. New Mexico, Albuquerque 1987 Zbl0761.05091
  7. Hammond P., Smith.D.H., Perfect codes in the graphs O k , J. Combin. Theory Ser.B 19 (1975), 239-255. (1975) Zbl0282.94007MR0414437
  8. Kartochvíl J., Perfect codes over graphs, J. Combin.Theory Ser. B 40 (1986), 224-228. (1986) MR0838221
  9. Kratochvíl J., Perfect codes in general graphs, to appear in Proceedings VIIth Hungarian colloqium on combinatorics, Eger 1987 Zbl0688.94004MR1141598
  10. Kratochvíl J., One-perfect codes over self-complementary graphs, Comment. Math. Univ. Carolinae 26 (1985), 589-595. (1985) Zbl0576.94021MR0817829
  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. (1988) Zbl0655.68039MR1023443
  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). (1987) Zbl0731.94017
  13. Kratochvíl J., Perfect codes and two-graphs, submitted Zbl0693.05060
  14. Smith D.H., Perfect codes in the graphs O k and L ( O k ) , Glasgow Math. J. 21 (1980), 169-172. (1980) Zbl0432.05048MR0582126
  15. Tietäväinen A., On the nonexistence of perfect codes over finite fields, SIAM J. Appl. Math. 24 (1973), 88-96. (1973) Zbl0233.94004MR0325260

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.