9842 search results - page 6 / 1969 » The Complexity of the Matching-Cut Problem |
101
click to vote
CSFW
2011
IEEE
13 years 11 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
105
Voted
JACM
2010
14 years 10 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
106
Voted
CIAC
2010
Springer
14 years 8 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
82
Voted
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...