3019 search results - page 213 / 604 » Approximating the Domatic Number |
164
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
189
click to vote
SAGT
2009
Springer
15 years 11 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
161
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extract...
151
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
In this note we study the existence of a solution to the survey-propagation equations for the random K-satisfiability problem for a given instance. We conjecture that when the num...
160
click to vote
FFA
2010
15 years 5 months ago
2010
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...