Polynomial estimation of the complexity of algorithms
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 6, pp. 1032-1040
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{ZVMMF_1999_39_6_a12,
author = {V. V. Voevodin},
title = {Polynomial estimation of the complexity of algorithms},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1032--1040},
year = {1999},
volume = {39},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_6_a12/}
}
V. V. Voevodin. Polynomial estimation of the complexity of algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 6, pp. 1032-1040. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_6_a12/
[1] Voevodin V. V., Informatsionnaya struktura algoritmov, Izd-vo MGU, M., 1997
[2] Voevodin V. V., “Information structure of sequential programs”, Russ. J. of Numer Analys and Modelling, 10:3 (1995), 279–286 | DOI | MR | Zbl
[3] Voevodin V. V,, Voevodin Vl. V., “V-Ray technology: a new approach to the old problems. Optimization of the TRFD Perfect Club Benchmark to CRAY Y-MP and CRAY T3D supercomputers”, Proc. High Performance Comput. Symposium'95 (Phoenix, Arizona, 1995), 380–385
[4] Voevodin V. V., Mathematical foundation of parallel computing, Ser. Comput. Sci., 33, World Scient. Publ. Co., 1992 | MR | Zbl