A nonlinear lower bound for random-access machines under logarithmic cost

Authors:
Arnold Schönhage
Affiliations:
Univ. Tu¨bingen, Federal Republic of Germany
Venue:
Journal of the ACM (JACM)
Year:
1988

Citing 1
Cited 2

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Preface: Festschrift in honor of Arnold Schönhage

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Relative Cost Random Access Machines

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

For on-line random-access machines under logarithmic cost, the simple task of storing arbitrary binary inputs has nonlinear complexity. Even if all kinds of powerful internal operations are admitted and reading of storage locations is free of charge, just successively changing the storage contents for properly storing arbitrary n-bit inputs requires an average cost of order n · log*n.