|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2006, Number 6, Pages 56–64
(Mi ivm1224)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Lower bounds for the complexity of probabilistic binary programs with a large ordered part
R. G. Mubarakzyanov Kazan State University
Received: 26.01.2005
Citation:
R. G. Mubarakzyanov, “Lower bounds for the complexity of probabilistic binary programs with a large ordered part”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 6, 56–64; Russian Math. (Iz. VUZ), 50:6 (2006), 54–62
Linking options:
https://www.mathnet.ru/eng/ivm1224 https://www.mathnet.ru/eng/ivm/y2006/i6/p56
|
Statistics & downloads: |
Abstract page: | 146 | Full-text PDF : | 49 | References: | 44 | First page: | 3 |
|