References
- Korte B. Schrader R. A survey on oracle techniques 1981 Report No. 81186-OR Bonn
- Jensen , P. and Korte , B. 1982 . Complexity of matroid property algorithms . SIA.M J. otr Computing , 11 : 184 – 190 .
- Hausmann , D. and Korte , B. 1978 . Lower bounds on the worst-case complexity of some oracle algorithms . Discr. Math , 24 : 261 – 276 .
- Linial , N. and Saks , M. 1985 . Every poset has a central element . J. Comb. Theor., Ser. A , 40 : 195 – 210 .
- Fischer , M. , Nemhauser , G. and Wolsey , L. 1978 . An Analysis of Approximations for Maximizing Submodular Set Functions-2 . Math. Progranz. Study , 8 : 73 – 87 .
- Faigle , U. , Lovasz , L. , Schrader , R. and Turan , Gy. 1986 . Searching in trees, series-parallel and interval orders . SIAM J. Comput , 15 : 1075 – 1084 .
- Linial , N. and Saks , M. 1985 . Searching ordered structures . J. Algorithms , 6 : 86 – 103 .
- Steiner , G. 1987 . Searching in 2-dimensional partial orders . J. Algorithms , 8 : 95 – 105 .
- Hansel , G. 1966 . Sure le nombre des fonctions booleenes monotones de n variables . C. R. Acad. Sci., Paris , 262 : 1088 – 1090 .
- Alekseev , V. 1976 . About decoding some classes of monotonic boolean fc.nctions of multivalued logic . Zh. Vychisl. Mat. Mat. Fis , 16 : 189 – 198 .
- Socolov , N. 1987 . Optimal algorithm for decoding monotone functions . Zh. Vychisl. Mat. Mat. Fis , 27 : 1878 – 1887 .
- Genkin , A. and Mytchnik. 1990 . Optimal algorithm for maximization of submodular function . Autonzat. and Telem , 8 : 139 – 147 . Russian
- Serjantov , A. 1984 . On optimal algorithm for decoding lnonotone functions . Dokl. Acacl. Sci., USSR , 277 : 304 – 307 .
- Kovalev M. Matroids in discrete optimization Belorus Univ Minsk, , Russian 1989
- Kovalev , M. and Moshchensky , A. 1992 . Optimal search of extremums of convex functions on lattices . Discrete Math. Appl , 2 : 45 – 58 .