No. Title Author Year
1 Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions Ambainis, Andris et al. 2016
2 Randomized Query Complexity of Sabotaged and Composed Functions Shalev, Ben-David et al. 2016
3 Separating Decision Tree Complexity from Subcube Partition Complexity Kothari, Robin et al. 2015
4 An optimal quantum algorithm for the oracle identification problem Kothari, Robin 2014
5 Dequantizing Read-once Quantum Formulas Cosentino, Alessandro et al. 2013
6 Easy and Hard Functions for the Boolean Hidden Shift Problem Childs, Andrew M. et al. 2013
7 Quantum query complexity of minor-closed graph properties Childs, Andrew M. et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 7

DROPS-Home | Fulltext Search | Imprint Published by LZI