1 citations · 1 across the 3 of their papers we have counts for
5 papers
Recognizing distributed approval voting forms and correspondences
Endre Boros, Ondrej Cepek, Vladimir Gurvich +1
Each voter has cards that (s)he distributes among the candidates as a measure of approval. One (or several) candidate(s) who received the maximum number o…
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…
Generating clause sequences of a CNF formula
Kristóf Bérczi, Endre Boros, Ondřej Čepek +3
Given a CNF formula with clauses and variables , a truth assignment of leads to a clause sequence $σ_Φ(a)=(C_…
Approximating minimum representations of key Horn functions
Kristóf Bérczi, Endre Boros, Ondřej Čepek +2
Horn functions form a subclass of Boolean functions and appear in many different areas of computer science and mathematics as a general tool to describe implications and dependenci…
Separable discrete functions: recognition and sufficient conditions
Endre Boros, Ondrej Cepek, Vladimir Gurvich
A discrete function of variables is a mapping , where , and are arbitrary finite sets. Function is cal…