Items where Author is "Santha, M."
 | Up a level |
Number of items: 12.
ISI Article
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2014 | Friedl, Katalin and Ivanyos, Gábor and Magniez, F. and Santha, M. and Sen, P. Hidden translation and translating coset in quantum computing |  | ISI Article |
| 2006 | Friedl, K. and Ivanyos, Gábor and Santha, M. and Verhoeven, YF Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes | | ISI Article |
Article
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2005 | Friedl, K. and Ivanyos, Gábor and Santha, M. and Verhoeven, YF On the black-box complexity of Sperner's Lemma | Article | |
| 2003 | Ivanyos, Gábor and Magniez, F. and Santha, M. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem | Article | |
| 2003 | Friedl, K. and Magniez, F. and Santha, M. and Sen, P. Quantum testers for hidden group properties | Article | |
| 2002 | Bazgan, C. and Santha, M. and Tuza, Zsolt Efficient approximation algorithms for the subset-sums equality problem | Article | |
| 1999 | Bazgan, C. and Santha, M. and Tuza, Zsolt On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs | Article |
Book Section
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2015 | Ivanyos, Gábor and Santha, M. On Solving Systems of Diagonal Polynomial Equations Over Finite Fields | | Book Section |
| 1998 | Bazgan, C. and Santha, M. and Tuza, Zsolt Efficient approximation algorithms for the subset-sums equality problem | Book Section |
Conference or Workshop Item
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2005 | Friedl, K. and Ivanyos, Gábor and Santha, M. Efficient testing of groups | Conference or Workshop Item | |
| 2003 | Friedl, K. and Ivanyos, Gábor and Magniez, F. and Santha, M. and Sen, P. Hidden translation and orbit coset in quantum computing | Conference or Workshop Item | |
| 1998 | Bazgan, C. and Santha, M. and Tuza, Zsolt On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs | Conference or Workshop Item |
