Equivalences between triangle and range query problems

Lech Duraj, Krzysztof Kleiner, Adam Polak +1

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 v…