504 search results - page 51 / 101 » The Complexity of Symmetry-Breaking Formulas |
CSCLP
2003
Springer
14 years 3 months ago
2003
Springer
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
FORMATS
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
CASC
2006
Springer
14 years 1 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
DAGSTUHL
2006
13 years 11 months ago
2006
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
NIPS
2004
13 years 11 months ago
2004
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...