A method to prove query lower bounds
Maddirla Jagadish, Sridhar R. Iyer · 2014
The query-model or decision-tree model is a computational model in which the algorithm has to solve a given problem by making a sequence of queries which have 'Yes' or 'No' answers. A large class of algorithms can be described on this model and we can also prove non-trivial lower bounds for many problems on this model.