Izv. Vyssh. Uchebn. Zaved. Mat., 1985 Number 8, Pages 35–42
(Mi ivm7393)
|
Lower bounds for complexity of monotone computation of polynomials and universal schemes
R. G. Nigmatullin
UDC:
519.714
MSC: 68Q15 Received: 14.02.1985
English version:
Soviet Mathematics (Izvestiya VUZ. Matematika), 1985,
29:8,
43–53
Bibliographic databases:
© , 2024
Fulltext:
PDF file (844 kB)