An lower bound for computing the sum of even-ranked elements

An lower bound for computing the sum of even-ranked elements

Given a sequence A of 2n real numbers, the EvenRankSum problem asks for the sum of the n values that are at the even positions in the sorted order of the elements in A. The authors prove that, in the algebraic computation-tree model, this problem has time complexity ...(nlogn). This solves an open p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2009-07, Vol.109 (16), p.955-956
Hauptverfasser: Mörig, Marc, Rautenbach, Dieter, Smid, Michiel, Tusch, Jan
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Complexity theory
Mathematical models
Problem solving
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Given a sequence A of 2n real numbers, the EvenRankSum problem asks for the sum of the n values that are at the even positions in the sorted order of the elements in A. The authors prove that, in the algebraic computation-tree model, this problem has time complexity ...(nlogn). This solves an open problem posed by Michael Shamos at the Canadian Conference on Computational Geometry in 2008. (ProQuest: ... denotes formulae/symbols omitted.)
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2009.05.004