Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952001 | Theoretical Computer Science | 2017 | 13 Pages |
Abstract
We present three algorithms: two of them working under some constrained scenarios, and achieving optimal time complexity Î(klogâ¡(n/k)+1), while the third general algorithm accomplishes the goal in time O(klogâ¡nlogâ¡logâ¡n).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Gianluca De Marco, Dariusz R. Kowalski,