15 search results - page 1 / 3 » The Quantum Black-Box Complexity of Majority |
ALGORITHMICA
2002
13 years 4 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
DAGSTUHL
2006
13 years 6 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
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 ...
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...