Searcharxiv⌕ Search

arXiv subjects

Ondrej Cepek

Publications and source records attributed to Ondrej Cepek.

3 recordsLinked to original sources

A Polynomial Time Approximation for the Minimization of Implication Systems and Horn CNFs

An implication system is a collection of rules of the form $B \imp H$, where the set $B$ of Boolean variables is the {\em body} of the rule, while $H$ is the set of its {\em heads}. Such a rule is an aggregate representation of individual implications $B\imp h$, for $h\in H$ which correspond to the clauses of an equivalent CNF representation of a Horn Boolean function. An implication system is {\em body-minimum}/{\em clause-minimum} if it has the minimum number of bodies/clauses among all logically equivalent implication systems. The corresponding minimization problems appear not only in the context of implication systems, but also as problems for closure systems, directed hypergraphs, representation of dependencies in relational databases, or in Horn CNF minimization. While body-minimization is known to be solvable in polynomial time (and there are several algorithms in the literature that solve this task), clause-minimization is known to be NP-hard. In fact, body-minimization has a particular canonical solution, called the GD-basis of the underlying Horn function that also can be computed efficiently. In this paper, we utilize a known connection between the two minimization problems stating that for every implication system there always exists a logically equivalent clause-minimum implication system which has the same bodies as its canonical GD-basis, see (B{é}rczi and B{é}rczi-Kov{á}cs, 2017), and (Adaricheva and Nation, 2014). We use this fact to design a polynomial time approximation algorithm which for any $δ>0$ outputs a $(\frac{1}{4} + δ)n$-factor approximation of the logically equivalent clause-minimum implication system on $n$ variables. This is an improvement from the best known algorithm so far that provides only an $(n-1)$-factor approximation, see (Hammer and Kogan, 1993).

cs.DM↗

Recognizing distributed approval voting forms and correspondences

Each voter $i \in I$ has $α_i$ cards that (s)he distributes among the candidates $a \in A$ as a measure of approval. One (or several) candidate(s) who received the maximum number of cards is (are) elected. We provide polynomial algorithms to recognize voting forms and voting correspondences generated by such voting schemes in cases when either the number of candidates or the number of voters is equal to $2$. We prove that for two voters, if $α_2 \geq α_1-2\geq 0$ then the unique voting correspondence has distinct rows. We also characterize voting forms with distinct rows.

math.CO↗

Separable discrete functions: recognition and sufficient conditions

A discrete function of $n$ variables is a mapping $g : X_1 \times \ldots \times X_n \rightarrow A$, where $X_1, \ldots, X_n$, and $A$ are arbitrary finite sets. Function $g$ is called {\em separable} if there exist $n$ functions $g_i : X_i \rightarrow A$ for $i = 1, \ldots, n$, such that for every input $x_1, \ldots ,x_n$ the function $g(x_1, \ldots, x_n)$ takes one of the values $g_1(x_1), \ldots ,g_n(x_n)$. Given a discrete function $g$, it is an interesting problem to ask whether $g$ is separable or not. Although this seems to be a very basic problem concerning discrete functions, the complexity of recognition of separable discrete functions of $n$ variables is known only for $n=2$. In this paper we will show that a slightly more general recognition problem, when $g$ is not fully but only partially defined, is NP-complete for $n \geq 3$. We will then use this result to show that the recognition of fully defined separable discrete functions is NP-complete for $n \geq 4$. The case $n = 2$ is well-studied in the context of game theory, where (separable) discrete functions of $n$ variables are referred to as (assignable) $n$-person game forms. There is a known sufficient condition for assignability (separability) of two-person game forms (discrete functions of two variables) called (weak) total tightness of a game form. This property can be tested in polynomial time, and can be easily generalized both to higher dimension and to partially defined functions. We will prove in this paper that weak total tightness implies separability for (partially defined) discrete functions of $n$ variables for any $n$, thus generalizing the above result known for $n=2$. Keywords: separable discrete functions, totally tight and assignable game forms

math.CO↗