Items where Author is "Santha, M"
 | Up a level |
Number of items: 9.
ISI Article
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2012 | Ivanyos, Gábor and Sanselme, L and Santha, M An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups |  | ISI Article |
Article
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2018 | Ivanyos, Gábor and Kulkarni, R and Qiao, YM and Santha, M and Sundaram, A On the complexity of trial and error for constraint satisfaction problems | | Article |
| 2018 | Ivanyos, Gábor and Karpinski, M and Santha, M and Saxena, N and Shparlinski, IE Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields | Article | |
| 2017 | Ivanyos, Gábor and Santha, M Solving systems of diagonal polynomial equations over finite fields | | Article |
| 2015 | Ivanyos, Gábor and Karpinski, M and Qiao, Y and Santha, M Generalized Wong sequences and their applications to Edmonds' problems | | Article |
Book Section
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2018 | Ivanyos, Gábor and Prakash, A and Santha, M On learning linear functions from subset and its applications in quantum computing | Book Section | |
| 2017 | Belovs, A and Ivanyos, Gábor and Qiao, Y and Santha, M and Yang, S On the polynomial parity argument complexity of the combinatorial nullstellensatz | Book Section | |
| 2015 | Ivanyos, Gábor and Santha, M On Solving Systems of Diagonal Polynomial Equations Over Finite Fields | | Book Section |
Conference or Workshop Item
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2012 | Ivanyos, Gábor and Klauck, H and Lee, T and Santha, M and de, Wolf New bounds on the classical and quantum communication complexity of some graph properties | | Conference or Workshop Item |
