Browsing byAuthorSantha, M

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 15 of 15
Issue DateTitleAuthor(s)
-A composition theorem for randomized query complexity via max conflict complexityGavinsky, D; Lee, T; Santha, M; Sanyal, S
2014-01-01An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear groupDecker, T; Ivanyos, G; Kulkarni, R; Qiao, Y; Santha, M
2015-01-01Generalized Wong sequences and their applications to Edmonds' problemsIvanyos, G; Karpinski, M; Qiao, Y; Santha, M
2014-03-01Generalized Wong sequences and their applications to Edmonds' problemsIvanyos, G; Karpinski, M; Qiao, Y; Santha, M
2017-02-01Improved Quantum Query Algorithms for Triangle Detection and Associativity TestingLee, T; Magniez, F; Santha, M
2018-03-01On the complexity of trial and error for constraint satisfaction problemsIvanyos, G; Kulkarni, R; Qiao, Y; Santha, M; Sundaram, A
2014-01-01On the complexity of trial and error for constraint satisfaction problemsIvanyos, G; Kulkarni, R; Qiao, Y; Santha, M; Sundaram, A
2020-11-11On the cut dimension of a graphLee, T; Li, T; Santha, M; Zhang, S
2021-07-01On the cut dimension of a graphLee, T; Li, T; Santha, M; Zhang, S
2017-07-01On the polynomial parity argument complexity of the combinatorial nullstellensatzBelovs, A; Ivanyos, G; Qiao, Y; Santha, M; Yang, S
2020-01-01Quadratically Tight Relations for Randomized Query ComplexityJain, R; Klauck, H; Kundu, S; Lee, T; Santha, M; Sanyal, S; Vihrovs, J
2020-07-16Quantum algorithms for graph problems with cut queriesLee, T; Santha, M; Zhang, S
2021-01-01Quantum algorithms for graph problems with cut queriesLee, T; Santha, M; Zhang, S
-Quantum attacks on Bitcoin, and how to protect against themAggarwal, D; Brennen, GK; Lee, T; Santha, M; Tomamichel, M
-Strategies for quantum racesLee, T; Ray, M; Santha, M