|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1999, Volume 39, Number 6, Pages 1032–1040
(Mi zvmmf1672)
|
|
|
|
Polynomial estimation of the complexity of algorithms
V. V. Voevodin Institute of Numerical Mathematics, Russian Academy of Sciences, Moscow
Received: 24.11.1998
Citation:
V. V. Voevodin, “Polynomial estimation of the complexity of algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 39:6 (1999), 1032–1040; Comput. Math. Math. Phys., 39:6 (1999), 994–1001
Linking options:
https://www.mathnet.ru/eng/zvmmf1672 https://www.mathnet.ru/eng/zvmmf/v39/i6/p1032
|
Statistics & downloads: |
Abstract page: | 267 | Full-text PDF : | 120 | References: | 53 | First page: | 1 |
|