TY  - JOUR
AU  - È. È. Gasanov
TI  - A lower bound for the complexity of inclusive search in the class of tree-like circuits
JO  - Diskretnaya Matematika
PY  - 1998
SP  - 63
EP  - 72
VL  - 10
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1998_10_1_a5/
LA  - ru
ID  - DM_1998_10_1_a5
ER  -