No. Title Author Year
1 On the Cut Dimension of a Graph Lee, Troy et al. 2021
2 A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity Gavinsky, Dmitry et al. 2019
3 A Composition Theorem for Randomized Query Complexity Anshu, Anurag et al. 2018
4 On Learning Linear Functions from Subset and Its Applications in Quantum Computing Ivanyos, Gábor et al. 2018
5 Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2) Gharibian, Sevag et al. 2018
6 Strategies for Quantum Races Lee, Troy et al. 2018
7 On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz Belovs, Aleksandrs et al. 2017
8 Linear Time Algorithm for Quantum 2SAT Arad, Itai et al. 2016
9 On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems Arad, Itai et al. 2016
10 Separating Decision Tree Complexity from Subcube Partition Complexity Kothari, Robin et al. 2015
11 Generalized Wong sequences and their applications to Edmonds' problems Ivanyos, Gábor et al. 2014
12 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: 12


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