Method of determining lower bounds for the complexity of $P$-schemes
Matematičeskie zametki, Tome 10 (1971) no. 1, pp. 83-92
Cet article a éte moissonné depuis la source Math-Net.Ru
A method of calculating lower bounds, quadratic in the arguments of the function, for the complexity of $P$-schemes.
@article{MZM_1971_10_1_a11,
author = {V. M. Khrapchenko},
title = {Method of determining lower bounds for the complexity of $P$-schemes},
journal = {Matemati\v{c}eskie zametki},
pages = {83--92},
year = {1971},
volume = {10},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1971_10_1_a11/}
}
V. M. Khrapchenko. Method of determining lower bounds for the complexity of $P$-schemes. Matematičeskie zametki, Tome 10 (1971) no. 1, pp. 83-92. http://geodesic.mathdoc.fr/item/MZM_1971_10_1_a11/