Advertisement

A lower bound of 1/2n2 on linear search programs for the knapsack problem

  • David Dobkin
  • Richard J. Lipton
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Dobkin. A non-linear lower bound on linear search tree programs for solving knapsack problems. Yale Computer Science Research Report #52, 1975.Google Scholar
  2. [2]
    D. Dobkin and R. Lipton. The complexity of searching lines in the plane. Submitted for publication.Google Scholar
  3. [3]
    D. Dobkin and R. Lipton. On some generalizations of binary search. ACM Symposium on the Theory of Computing, Seattle, Washington, May 1974.Google Scholar
  4. [4]
    D. Dobkin and R. Lipton. On the complexity of computations under varying sets of primitive operations. Automata Theory and Formal Languages, Springer-Verlag Lecture Notes in Computer Science #33.Google Scholar
  5. [5]
    R. Karp. Reducibilities among combinatiral problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, 85–104, Plenum Press, 1972.Google Scholar
  6. [6]
    M. Rabin. Proving the simultaneous positivity of linear forms. JCSS, 6, 1972.Google Scholar
  7. [7]
    E. Reingold. Computing the maximum and the median. Twelfth Annual Symposium on Switching and Automata Theory, 1971.Google Scholar
  8. [8]
    C. Schnorr. A lower bound on the number of additions in monotone computations of monotone rational polynomials. Unpublished manuscript.Google Scholar
  9. [9]
    E. L. Sheng. Threshold Logic. Academic Press, 1969.Google Scholar
  10. [10]
    P. Spira. Complete linear proofs of systems of linear inequalities. JCSS, 6, pp. 205–216, 1972.Google Scholar
  11. [11]
    S. Yajima and T. Ibaraki. A lower bound on the number of threshold functions. IEEE EC14:926–929, 1965.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • David Dobkin
    • 1
  • Richard J. Lipton
    • 1
  1. 1.Department of Computer ScienceYale UniversityNew HavenUSA

Personalised recommendations