2766 search results - page 466 / 554 » Algorithms for trigonometric polynomials |
111
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
126
click to vote
WINE
2005
Springer
15 years 9 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
123
click to vote
ICICS
2005
Springer
15 years 9 months ago
2005
Springer
Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a f...
119
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
131
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...