No. Title Author Year
1 A Composition Theorem for Randomized Query Complexity Anshu, Anurag et al. 2018
2 On Learning Linear Functions from Subset and Its Applications in Quantum Computing Ivanyos, Gábor et al. 2018
3 Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2) Gharibian, Sevag et al. 2018
4 On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz Belovs, Aleksandrs et al. 2017
5 Linear Time Algorithm for Quantum 2SAT Arad, Itai et al. 2016
6 On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems Arad, Itai et al. 2016
7 Separating Decision Tree Complexity from Subcube Partition Complexity Kothari, Robin et al. 2015
8 Generalized Wong sequences and their applications to Edmonds' problems Ivanyos, Gábor et al. 2014
9 New bounds on the classical and quantum communication complexity of some graph properties Ivanyos, Gábor et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI