1225 search results - page 50 / 245 » The Instance Complexity Conjecture |
CP
2009
Springer
14 years 9 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
JELIA
2004
Springer
14 years 2 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
FM
2003
Springer
14 years 2 months ago
2003
Springer
The complexity of embedded controllers is steadily increasing. This trend, stimulated by the continuous improvement of the computational power of hardware, demands for a correspond...