13 search results - page 2 / 3 » Tight Bounds on the Complexity of Recognizing Odd-Ranked Ele... |
ICDCN
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
ISAAC
2010
Springer
13 years 3 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
MFCS
2009
Springer
13 years 12 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...