RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 1,
2004
Volume 11,
Issue 2,
Pages
41–65
(Mi da103)
This article is cited in
1
paper
On a method for obtaining bounds for the complexity of schemes over an arbitrary infinite basis
O. M. Kasim-zade
M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
UDC:
519.6
Received:
05.02.2004
Fulltext:
PDF file (304 kB)
References
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2025
Fulltext:
PDF file (304 kB)