Equivalences between triangle and range query problems
Copyright © 2020 by SIAM We define a natural class of range query problems, and prove that all problems within this class have the same time complexity (up to polylogarithmic factors). The equivalence is very general, and even applies to online algorithms. This allows us to obtain new improved algor...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2021-11-09T16:12:34Z.
|
| Subjects: | |
| Online Access: | Get fulltext |