O. Čepek

activity

20172020

most citedApproximating minimum representations of key Horn functions

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

Recognizing distributed approval voting forms and correspondences

Endre Boros, Ondrej Cepek, Vladimir Gurvich +1

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 o…

cs.DM2020

Unique key Horn functions

Kristóf Bérczi, Endre Boros, Ondřej Čepek +2

Given a relational database, a key is a set of attributes such that a value assignment to this set uniquely determines the values of all other attributes. The database uniquely def…

cs.DM2020

Generating clause sequences of a CNF formula

Kristóf Bérczi, Endre Boros, Ondřej Čepek +3

Given a CNF formula $Φ$ with clauses $C_{1}, \dots, C_{m}$ and variables $V = {x_{1}, \dots, x_{n}}$ , a truth assignment $a : V \to {0, 1}$ of $Φ$ leads to a clause sequence $σ_Φ(a)=(C_…