Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also de...
A model for statistical ranking is a family of probability distributions whose states are orderings of a xed nite set of items. We represent the orderings as maximal chains in a ...
We investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a ...
We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.