We introduce the parameter of block elimination distance as a measure how close graph is to some particular class. Formally, given class $${\mathcal {G}}$$ , {B}}({\mathcal {G}})$$ contains all graphs whose blocks belong and {A}}({\mathcal where removal vertex creates in . Given hereditary we recursively define $${{\mathcal {G}}}^{(k)}$$ so that {G}}^{(0)}={\mathcal and, if $$k\ge 1$$ {G}}^{(k)...

Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.’s first-order variable elimination (FOVE) has focused on the sharing of potentials across interchangeable random variables. In this paper, we also exploit interchangeability within individual potentials by introducing counting formulas, which i...

Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal dee-nition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new eecient and exible constructions ...

The concept of conflict transformation emerges as a perspective that challenges certain assumptions of conflict resolution and conflict management (Lederach, 2003). The idea of transformation does not entail the elimination or control of conflict, and rather regards conflict as a natural source of change, which is reflected in the transformation of attitudes, assumptions and behaviours, among o...

We introduce an optimization for model elimination (ME). An antilemma contains information about a failed search for a sub-proof. The application of antilemmas replaces unnecessary search attempts which can extremely improve the eeciency of the ME procedure. An-tilemma application works with other optimizations like lemmaizing and identical-ancestor pruning. We deene several reenements for the ...

We show how the Gaussian min-max theorem provides direct proofs of several famous results in asymptotic geometric analysis, such as, the Dvoretzky theorem, the Johnson-Lindenstrauss Lemma, Gluskin’s theorem on embedding in `1 , and others.