Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1976: Mathematical Foundations of Computer Science 1976 pp 265–269Cite as

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

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 45))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. D. Dobkin and R. Lipton. The complexity of searching lines in the plane. Submitted for publication.

    Google Scholar 

  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. 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. 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. M. Rabin. Proving the simultaneous positivity of linear forms. JCSS, 6, 1972.

    Google Scholar 

  7. E. Reingold. Computing the maximum and the median. Twelfth Annual Symposium on Switching and Automata Theory, 1971.

    Google Scholar 

  8. C. Schnorr. A lower bound on the number of additions in monotone computations of monotone rational polynomials. Unpublished manuscript.

    Google Scholar 

  9. E. L. Sheng. Threshold Logic. Academic Press, 1969.

    Google Scholar 

  10. P. Spira. Complete linear proofs of systems of linear inequalities. JCSS, 6, pp. 205–216, 1972.

    Google Scholar 

  11. S. Yajima and T. Ibaraki. A lower bound on the number of threshold functions. IEEE EC14:926–929, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, 06520, New Haven, CT, USA

    David Dobkin & Richard J. Lipton

Authors
  1. David Dobkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard J. Lipton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dobkin, D., Lipton, R.J. (1976). A lower bound of 1/2n2 on linear search programs for the knapsack problem. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_185

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_185

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation