3208 search results - page 137 / 642 » A Lower Bound for Primality |
167
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
162
click to vote
COCO
2009
Springer
16 years 1 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...
188
click to vote
FCT
2005
Springer
15 years 12 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 ...
188
click to vote
CORR
2010
Springer
15 years 6 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 ...
181
click to vote
EUSFLAT
2007
15 years 7 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 ...