18 citations · 20 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs
Endre Boros, Vladimir Gurvich, Martin Milanič
A hypergraph is said to be -Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of -Sperner hypergra…
Sprague-Grundy Function of Matroids and Related Hypergraphs
Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2
We consider a generalization of the classical game of called hypergraph . Given a hypergraph $\cH$ on the ground set of piles of stones, two p…
Sprague-Grundy Function of Symmetric Hypergraphs
Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2
We consider a generalization of the classical game of called hypergraph . Given a hypergraph $\cH$ on the ground set of piles of stones, two p…