Range Minimum Queries (2D) nm   log(nm)  bit encoding 1234 n5n5 1 0.30.13.52.40.7 2 5.21.60.64.28.7 m 3 1.43.86.54.10.2 1234 n5n5 1 0.30.13.52.40.7 2 5.21.60.64.28.7 m 3 1.43.86.54.10.2 1234 n5n5 1 0.30.13.52.40.7 2 5.21.60.64.28.7 m 3 1.43.86.54.10.2 RMQ(2,2,3,4) = (2,3) 1234 n5n5 1 31985 2 13741215 m 3 61014112 Rank matrix Lower bound:  (nm  log m) [Brodal, Davoodi, Rao 2012] Upper bound: O(nm  log m) [Brodal, Brodnik, Davoodi 2013] Query time
{}