TY  - JOUR
AU  - D. Yu. Grigor'ev
TI  - A lower bound for the computational complexity of a set of disjunctives in a monotone basis
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1977
SP  - 19
EP  - 25
VL  - 68
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1977_68_a1/
LA  - ru
ID  - ZNSL_1977_68_a1
ER  -