# zbMATH — the first resource for mathematics

A simple proof of a time-space trade-off for sorting with linear comparisons. (English) Zbl 0597.68052
Summary: It is shown how to extend the techniques originally used to prove a lower bound of $$\Omega (n^ 2)$$ for the product of the time and space consumed for sorting in branching programs with elementary comparisons, to the case of linear branching programs where linear functions on n input elements can be computed in unit time.
##### MSC:
 68P10 Searching and sorting 68Q25 Analysis of algorithms and problem complexity
##### Keywords:
linear branching programs
Full Text:
##### References:
 [1] Borodin, A.; Cook, S., A time-space tradeoff for sorting on a general sequential model of computation, (), 294-301 · Zbl 0478.68061 [2] Borodin, A.; Fischer, M.J.; Kirkpatrick, D.G.; Lynch, N.A.; Tompa, M., A time-space tradeoff for sorting on non-oblivious machines, (), 319-327 [3] Yao, A.C.-C., On the time-space tradeoff for sorting with linear queries, Theoret. comput. sci., 19, 2, 203-218, (1982) · Zbl 0547.68062
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.