2 papers
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-ph2002
Quantum testers for hidden group properties
Katalin Friedl, Frederic Magniez, Miklos Santha +1
We construct efficient or query efficient quantum property testers for two existential group properties which have exponential query complexity both for their decision problem in t…