|
This article is cited in 50 scientific papers (total in 51 papers)
Method of determining lower bounds for the complexity of $P$-schemes
V. M. Khrapchenko Institute for Applied Mathematics, USSR Academy of Sciences
Abstract:
A method of calculating lower bounds, quadratic in the arguments of the function, for the complexity of $P$-schemes.
Received: 27.07.1970
Citation:
V. M. Khrapchenko, “Method of determining lower bounds for the complexity of $P$-schemes”, Mat. Zametki, 10:1 (1971), 83–92; Math. Notes, 10:1 (1971), 474–479
Linking options:
https://www.mathnet.ru/eng/mzm7071 https://www.mathnet.ru/eng/mzm/v10/i1/p83
|
Statistics & downloads: |
Abstract page: | 338 | Full-text PDF : | 161 | First page: | 1 |
|