Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Cacioppo, Andrea"'
The graph coloring problem is an optimization problem involving the assignment of one of q colors to each vertex of a graph such that no two adjacent vertices share the same color. This problem is NP-hard and arises in various practical applications.
Externí odkaz:
http://arxiv.org/abs/2408.01503
Compound channel models offer a simple and straightforward way of analyzing the stability of decoder design under model variations. With this work we provide a coding theorem for a large class of practically relevant compound channel models. We give
Externí odkaz:
http://arxiv.org/abs/2105.04274