A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem
暂无分享,去创建一个
[1] R. Lipton,et al. On some generalizations of binary search , 1974, STOC '74.
[2] Saburo Muroga,et al. Lower Bound of the Number of Threshold Functions , 1966, IEEE Trans. Electron. Comput..
[3] Robert O. Winder,et al. Threshold logic , 1971, IEEE Spectrum.
[4] Philip M. Spira,et al. Complete Linear Proofs of Systems of Linear Inequalities , 1972, J. Comput. Syst. Sci..
[5] David P. Dobkin. A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems , 1976, J. Comput. Syst. Sci..
[6] Michael O. Rabin,et al. Proving Simultaneous Positivity of Linear Forms , 1972, J. Comput. Syst. Sci..
[7] Claus-Peter Schnorr,et al. A Lower Bound on the Number of Additions in Monotone Computations , 1976, Theor. Comput. Sci..
[8] Edward M. Reingold,et al. Computing the Maximum and the Median , 1971, SWAT.
[9] Toshihide Ibaraki,et al. A Lower Bound of the Number of Threshold Functions , 1965, IEEE Trans. Electron. Comput..
[10] Richard J. Lipton,et al. The Complexity of Searching Lines in the Plane: Preliminary Version. , 1975 .