Showing quant-phShow all
2 papers · 1 filter
quant-ph2005
On the black-box complexity of Sperner's Lemma
Katalin Friedl, Gabor Ivanyos, Miklos Santha +1
We present several results on the complexity of various forms of Sperner's Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ps…
quant-ph2003★ 13 cited
Quantum Algorithms for the Triangle Problem
Frederic Magniez, Miklos Santha, Mario Szegedy
We present two new quantum algorithms that either find a triangle (a copy of ) in an undirected graph on nodes, or reject if is triangle free. The first algorith…