198 search results - page 2 / 40 » Infinite mixtures of trees |
CSL
2007
Springer
13 years 9 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
COMBINATORICA
2004
13 years 4 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
CORR
2002
Springer
13 years 4 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...
DAGSTUHL
2008
13 years 6 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
BIRTHDAY
2008
Springer
13 years 7 months ago
2008
Springer
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...