| No. |
Title |
Author |
Year |
| 1 |
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming |
Allcock, Jonathan et al. |
2022 |
| 2 |
Quantum Algorithm for Stochastic Optimal Stopping Problems with Applications in Finance |
Doriguello, João F. et al. |
2022 |
| 3 |
On the Cut Dimension of a Graph |
Lee, Troy et al. |
2021 |
| 4 |
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity |
Gavinsky, Dmitry et al. |
2019 |
| 5 |
A Composition Theorem for Randomized Query Complexity |
Anshu, Anurag et al. |
2018 |
| 6 |
On Learning Linear Functions from Subset and Its Applications in Quantum Computing |
Ivanyos, Gábor et al. |
2018 |
| 7 |
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2) |
Gharibian, Sevag et al. |
2018 |
| 8 |
Strategies for Quantum Races |
Lee, Troy et al. |
2018 |
| 9 |
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz |
Belovs, Aleksandrs et al. |
2017 |
| 10 |
Linear Time Algorithm for Quantum 2SAT |
Arad, Itai et al. |
2016 |
| 11 |
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems |
Arad, Itai et al. |
2016 |
| 12 |
Separating Decision Tree Complexity from Subcube Partition Complexity |
Kothari, Robin et al. |
2015 |
| 13 |
Generalized Wong sequences and their applications to Edmonds' problems |
Ivanyos, Gábor et al. |
2014 |
| 14 |
New bounds on the classical and quantum communication complexity of some graph properties |
Ivanyos, Gábor et al. |
2012 |
