RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 1995 Volume 2, Issue 4, Pages 54–73 (Mi da473)

This article is cited in 2 papers

On the comparison of the complexities of binary $k$-programs

E. A. Okolnishnikova

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

UDC: 519.714

Received: 03.05.1995



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026