Mathematics
and Interactions
-
Videos linked to 68P10 Searching and sortingMore +
![The quantum query complexity of sorting under partial information]()
49:50published on December 18, 2017The quantum query complexity of sorting under partial information
By Jérémie Roland
![The information theoretic lower bound for comparison based sorting is (almost) tight, even when there is an arbitrary known distribution on the input array]()
24:27published on March 14, 2016The information theoretic lower bound for comparison based sorting is (almost) tight, even when there is an arbitrary known distribution on the input array
By Shay Moran
