Skip to main content
SpringerLink
Log in

A lower time bound for the knapsack problem on random access machines

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We consider random access machines which read the input integer by integer (not bit by bit). For this computational model we prove a quadratic lower bound for the n-dimensional knapsack problem. For this purpose, we combine a method due to Paul and Simon [1] to apply decision tree arguments to random access machines (with indirect storage access!) and a method due to Dobkin and Lipton [2] who proved the same lower bound for linear decision trees.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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)

    Google Scholar 

  3. Aho, A., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithmus. Reading, MA: Addison-Wesley 1974

    Google Scholar 

  4. Yajima, S., Ibanaki, T.: A Lower Bound on the Number of Threshold Functions. IEEE-EC 14, 926–929 (1965)

    Google Scholar 

  5. Blaschke, W.: Über den größten Kreis in einer konvexen Punktmenge. Jahresbericht der deutschen Mathematiker Vereinigung 23, 369–374 (1914)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, D-4800, Bielefeld, Fed. Rep.

    Peter Klein & Friedhelm Meyer auf der Heide

  2. Fachbereich Informatik, Johann Wolfgang Goethe Universität Frankfurt, D-6000, Frankfurt a.M., Fed. Rep.

    Peter Klein & Friedhelm Meyer auf der Heide

Authors
  1. Peter Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedhelm Meyer auf der Heide
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klein, P., auf der Heide, F.M. A lower time bound for the knapsack problem on random access machines. Acta Informatica 19, 385–395 (1983). https://doi.org/10.1007/BF00290735

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00290735

Keywords

Search

Navigation