RUS  ENG
Full version
JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive

Izv. Vyssh. Uchebn. Zaved. Mat., 2006 Number 6, Pages 56–64 (Mi ivm1224)

This article is cited in 1 paper

Lower bounds for the complexity of probabilistic binary programs with a large ordered part

R. G. Mubarakzyanov

Kazan State University

UDC: 519.714

Received: 26.01.2005


 English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2006, 50:6, 54–62

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024