3415 search results - page 142 / 683 » Lower Bounds for Kernelizations |
129
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
160
click to vote
FCT
2005
Springer
15 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 ...
154
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
156
click to vote
EUSFLAT
2007
15 years 6 months ago
2007
The theory of copulas provides a useful tool for modeling dependence in risk management. In insurance and finance, as well as in other applications, dependence of extreme events ...
134
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...