Element Distinctness, Frequency Moments, and Sliding Windows
| Autor: | Paul Beame, Raphaël Clifford, Widad Machmouchi |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Discrete mathematics
FOS: Computer and information sciences Computational complexity theory 010103 numerical & computational mathematics 0102 computer and information sciences Function (mathematics) Computational Complexity (cs.CC) 01 natural sciences Upper and lower bounds Randomized algorithm Element distinctness problem Combinatorics Moment (mathematics) Computer Science - Computational Complexity 010201 computation theory & mathematics Quantum algorithm 0101 mathematics Mathematics Complement (set theory) |
| Zdroj: | FOCS |
| DOI: | 10.48550/arxiv.1309.3690 |
| Popis: | We derive new time-space tradeoff lower bounds and algorithms for exactly computing statistics of input data, including frequency moments, element distinctness, and order statistics, that are simple to calculate for sorted data. We develop a randomized algorithm for the element distinctness problem whose time T and space S satisfy T in O (n^{3/2}/S^{1/2}), smaller than previous lower bounds for comparison-based algorithms, showing that element distinctness is strictly easier than sorting for randomized branching programs. This algorithm is based on a new time and space efficient algorithm for finding all collisions of a function f from a finite set to itself that are reachable by iterating f from a given set of starting points. We further show that our element distinctness algorithm can be extended at only a polylogarithmic factor cost to solve the element distinctness problem over sliding windows, where the task is to take an input of length 2n-1 and produce an output for each window of length n, giving n outputs in total. In contrast, we show a time-space tradeoff lower bound of T in Omega(n^2/S) for randomized branching programs to compute the number of distinct elements over sliding windows. The same lower bound holds for computing the low-order bit of F_0 and computing any frequency moment F_k, k neq 1. This shows that those frequency moments and the decision problem F_0 mod 2 are strictly harder than element distinctness. We complement this lower bound with a T in O(n^2/S) comparison-based deterministic RAM algorithm for exactly computing F_k over sliding windows, nearly matching both our lower bound for the sliding-window version and the comparison-based lower bounds for the single-window version. We further exhibit a quantum algorithm for F_0 over sliding windows with T in O(n^{3/2}/S^{1/2}). Finally, we consider the computations of order statistics over sliding windows. Comment: arXiv admin note: substantial text overlap with arXiv:1212.4372 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|