9842 search results - page 8 / 1969 » Problem complexity |
SSWMC
2004
13 years 9 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
JC
2008
13 years 7 months ago
2008
We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be -smooth ( = r+ : th...
KR
2004
Springer
14 years 28 days ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
CSFW
2011
IEEE
12 years 7 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...