|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 1985, Number 8, Pages 35–42
(Mi ivm7393)
|
|
|
|
Lower bounds for complexity of monotone computation of polynomials and universal schemes
R. G. Nigmatullin
Received: 14.02.1985
Citation:
R. G. Nigmatullin, “Lower bounds for complexity of monotone computation of polynomials and universal schemes”, Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 8, 35–42; Soviet Math. (Iz. VUZ), 29:8 (1985), 43–53
Linking options:
https://www.mathnet.ru/eng/ivm7393 https://www.mathnet.ru/eng/ivm/y1985/i8/p35
|
Statistics & downloads: |
Abstract page: | 116 | Full-text PDF : | 41 | First page: | 1 |
|