Items where Author is "Santha, M."

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | No Grouping
Number of items: 12.

ISI Article

DateAuthor/TitleDocument Type
2014Friedl, Katalin and Ivanyos, Gábor and Magniez, F. and Santha, M. and Sen, P.
Hidden translation and translating coset in quantum computing
ISI Article
2006Friedl, 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

DateAuthor/TitleDocument Type
2005Friedl, K. and Ivanyos, Gábor and Santha, M. and Verhoeven, YF
On the black-box complexity of Sperner's Lemma
Article
2003Ivanyos, Gábor and Magniez, F. and Santha, M.
Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem
Article
2003Friedl, K. and Magniez, F. and Santha, M. and Sen, P.
Quantum testers for hidden group properties
Article
2002Bazgan, C. and Santha, M. and Tuza, Zsolt
Efficient approximation algorithms for the subset-sums equality problem
Article
1999Bazgan, C. and Santha, M. and Tuza, Zsolt
On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs
Article

Book Section

DateAuthor/TitleDocument Type
2015Ivanyos, Gábor and Santha, M.
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
Book Section
1998Bazgan, C. and Santha, M. and Tuza, Zsolt
Efficient approximation algorithms for the subset-sums equality problem
Book Section

Conference or Workshop Item

DateAuthor/TitleDocument Type
2005Friedl, K. and Ivanyos, Gábor and Santha, M.
Efficient testing of groups
Conference or Workshop Item
2003Friedl, 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
1998Bazgan, C. and Santha, M. and Tuza, Zsolt
On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs
Conference or Workshop Item
This list was generated on Thu Mar 28 03:07:53 2024 CET.