Showing papers on "Decision tree model published in 1980"
TL;DR: In this paper the computational complexity of spanning tree problems is studied with the aim of identifying a borderline between easy and hard problems.
67 citations
28 Apr 1980
TL;DR: This work uses the information-theoretic approach, introduced in [13], to obtain restricted lower bounds on the time complexity of sorting to obtain lower time bounds for on-line simulation of one abstract storage unit by another.
Abstract: Static, descriptional complexity (program size) [16, 9] can be used to obtain lower bounds on dynamic, computational complexity (such as running time). We describe and discuss this “information-theoretic approach” in the following section. Paul introduced it in [13], to obtain restricted lower bounds on the time complexity of sorting. We use the approach here to obtain lower time bounds for on-line simulation of one abstract storage unit by another. A major goal of our work is to promote the approach.
14 citations
01 Jan 1980
8 citations
1 citations