9842 search results - page 263 / 1969 » The Complexity of the Matching-Cut Problem |
72
Voted
CSFW
2009
IEEE
15 years 7 months ago
2009
IEEE
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
CIARP
2005
Springer
15 years 6 months ago
2005
Springer
Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifie...
121
Voted
FCT
2007
Springer
15 years 6 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
123
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
116
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...