Endre Boros | DeepAI

DeepAI AI Chat

Featured Co-authors

Kristóf Bérczi
30 publications
Yusuke Kobayashi
30 publications
Martin Milanič
25 publications
Vladimir Gurvich
15 publications
Kazuhisa Makino
15 publications
Naoyuki Kamiyama
13 publications
Telikepalli Kavitha
13 publications
Khaled Elbassioni
11 publications
Petr Kučera
7 publications
Jernej Vičič
6 publications
Paul Kantor
3 publications

∙ 01/17/2023

Matroid Horn functions

Hypergraph Horn functions were introduced as a subclass of Horn function...

0 Kristóf Bérczi, et al. ∙

∙ 01/13/2023

Hypergraph Horn functions

Horn functions form a subclass of Boolean functions possessing interesti...

0 Kristóf Bérczi, et al. ∙

∙ 04/18/2022

Optimal Layered Defense For Site Protection

We present a model for layered security with applications to the protect...

0 Tsvetan Asamov, et al. ∙

∙ 02/23/2022

Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

We prove that a deterministic n-person shortest path game has a Nash equ...

0 Endre Boros, et al. ∙

∙ 08/02/2020

On the degree sequences of dual graphs on surfaces

Given two graphs G and G^* with a one-to-one correspondence between thei...

0 Endre Boros, et al. ∙

∙ 06/08/2020

Envy-free Relaxations for Goods, Chores, and Mixed Items

In fair division problems, we are given a set S of m items and a set N o...

0 Kristóf Bérczi, et al. ∙

∙ 02/17/2020

Unique key Horn functions

Given a relational database, a key is a set of attributes such that a va...

0 Kristóf Bérczi, et al. ∙

∙ 02/17/2020

Generating clause sequences of a CNF formula

Given a CNF formula Φ with clauses C_1,...,C_m and variables V={x_1,...,...

0 Kristóf Bérczi, et al. ∙

∙ 11/13/2018

Approximating minimum representations of key Horn functions

Horn functions form a subclass of Boolean functions and appear in many d...

0 Kristóf Bérczi, et al. ∙

∙ 05/09/2018

Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs

A hypergraph H is said to be 1-Sperner if for every two hyperedges the s...

0 Endre Boros, et al. ∙

∙ 04/25/2014

On Quadratization of Pseudo-Boolean Functions

We survey current term-wise techniques for quadratizing high-degree pseu...

0 Endre Boros, et al. ∙

∙ 04/25/2014

Quadratization of Symmetric Pseudo-Boolean Functions

A pseudo-Boolean function is a real-valued function f(x)=f(x_1,x_2,...,x...

0 Martin Anthony, et al. ∙

∙ 04/16/2012

Hardness Results for Approximate Pure Horn CNF Formulae Minimization

We study the hardness of approximation of clause minimum and literal min...

0 Endre Boros, et al. ∙