107 search results - page 2 / 22 » Combinatorial dichotomies in set theory |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
SIAMCOMP
1998
13 years 5 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
ICCV
2003
IEEE
13 years 10 months ago
2003
IEEE
Multiple projections of a scene cannot be arbitrary, the allowed configurations being given by matching constraints. This paper presents new matching constraints on multiple proj...
APAL
2010
13 years 5 months ago
2010
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
JCT
2006
13 years 5 months ago
2006
A review is given of some of the mathematical research of Bruce Rothschild, emphasizing his results in combinatorial theory, especially that part known as Ramsey Theory. Special em...