This is a tutorial and survey paper on kernels, kernel methods, and related fields. We start
with reviewing the history of kernels in functional analysis and machine learning. Then …

Many natural combinatorial problems can be expressed as constraint satisfaction problems.
This class of problems is known to be NP-complete in general, but certain restrictions on the …

Constraint Satisfaction Problems Solvable by Local Consistency Methods Page 1 i i i i 3
Constraint Satisfaction Problems Solvable by Local Consistency Methods LIBOR BARTO …

A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a
fixed template is that pp-interpretations between at most countable ω-categorical relational …

Universitext is a series of textbooks that presents material from a wide variety of
mathematical disciplines at master's level and beyond. The books, often well class-tested by …

In recent years, the evolution of Physics-Informed Neural Networks (PINNs) has reduced the
gap between Deep Learning (DL) based methods and analytical/numerical approaches in …

Tame congruence theory identifies six Maltsev conditions associated with locally finite
varieties omitting certain types of local behaviour. Extending a result of Siggers, we show …

The tractability conjecture for finite domain constraint satisfaction problems (CSPs) stated
that such CSPs are solvable in polynomial time whenever there is no natural reduction, in …

Set theory is the branch of mathematical logic that studies sets and is one of the greatest
achievements of modern mathematics. This branch of mathematics forms a foundation for …

There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely
bounded homogeneous structures: the first one states that tractability of the CSP of such a …