1. Paul, W.J., Simon, J.: Decision Trees and Random Access Machines. Symposium �ber Logik und Algorithmik, Z�rich 1980
2. Dobkin, D., Lipton, R.: A Lower Bound of 1/2n 2 on Linear Search Programs for the Knapsack Problem. J.C.S.S. 16, 417?421 (1975)
3. Aho, A., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithmus. Reading, MA: Addison-Wesley 1974
4. Yajima, S., Ibanaki, T.: A Lower Bound on the Number of Threshold Functions. IEEE-EC 14, 926?929 (1965)
5. Blaschke, W.: �ber den gr��ten Kreis in einer konvexen Punktmenge. Jahresbericht der deutschen Mathematiker Vereinigung 23, 369?374 (1914)