18 citations · 43 across the 32 of their papers we have counts for
11 papers · 1 filter
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games
Endre Boros, Vladimir Gurvich, Kazuhisa Makino +1
We study remoteness function of impartial games introduced by Smith in 1966. The player who moves from a position can win if and only if is odd. Th…
Matroid Horn functions
Kristóf Bérczi, Endre Boros, Kazuhisa Makino
Hypergraph Horn functions were introduced as a subclass of Horn functions that can be represented by a collection of circular implication rules. These functions possess distinguish…
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…
Ranking top-k trees in tree-based phylogenetic networks
Momoko Hayamizu, Kazuhisa Makino
'Tree-based' phylogenetic networks proposed by Francis and Steel have attracted much attention of theoretical biologists in the last few years. At the heart of the definitions of t…
On the Sprague-Grundy function of compound games
Endre Boros, Vladimir Gurvich, Levi Kitrossky +1
The classical game of {\sc Nim} can be naturally extended and played on an arbitrary hypergraph $\cH \subseteq 2^V \setminus \{\emptyset\}$ whose vertices co…
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…