Issue Date | Title | Author(s) |
- | A composition theorem for randomized query complexity via max conflict
complexity | Gavinsky, D; Lee, T; Santha, M; Sanyal, S |
2014-01-01 | An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group | Decker, T; Ivanyos, G; Kulkarni, R; Qiao, Y; Santha, M |
2015-01-01 | Generalized Wong sequences and their applications to Edmonds' problems | Ivanyos, G; Karpinski, M; Qiao, Y; Santha, M |
2014-03-01 | Generalized Wong sequences and their applications to Edmonds' problems | Ivanyos, G; Karpinski, M; Qiao, Y; Santha, M |
2017-02-01 | Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing | Lee, T; Magniez, F; Santha, M |
2014-01-01 | On the complexity of trial and error for constraint satisfaction problems | Ivanyos, G; Kulkarni, R; Qiao, Y; Santha, M; Sundaram, A |
2018-03-01 | On the complexity of trial and error for constraint satisfaction problems | Ivanyos, G; Kulkarni, R; Qiao, Y; Santha, M; Sundaram, A |
2020-11-11 | On the cut dimension of a graph | Lee, T; Li, T; Santha, M; Zhang, S |
2021-07-01 | On the cut dimension of a graph | Lee, T; Li, T; Santha, M; Zhang, S |
2017-07-01 | On the polynomial parity argument complexity of the combinatorial nullstellensatz | Belovs, A; Ivanyos, G; Qiao, Y; Santha, M; Yang, S |
2020-01-01 | Quadratically Tight Relations for Randomized Query Complexity | Jain, R; Klauck, H; Kundu, S; Lee, T; Santha, M; Sanyal, S; Vihrovs, J |
2020-07-16 | Quantum algorithms for graph problems with cut queries | Lee, T; Santha, M; Zhang, S |
2021-01-01 | Quantum algorithms for graph problems with cut queries | Lee, T; Santha, M; Zhang, S |
- | Quantum attacks on Bitcoin, and how to protect against them | Aggarwal, D; Brennen, GK; Lee, T; Santha, M; Tomamichel, M |
- | Strategies for quantum races | Lee, T; Ray, M; Santha, M |