#### Filter Results:

- Full text PDF available (128)

#### Publication Year

1984

2018

- This year (7)
- Last 5 years (38)
- Last 10 years (93)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Endre Boros, Peter L. Hammer
- Discrete Applied Mathematics
- 2002

This article brie°y surveys some fundamental results concerning pseudo-Boolean functions, i.e. real-valued functions of 0-1 variables. Hundreds of papers have been devoted to the investigation of… (More)

- Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik
- IEEE Trans. Knowl. Data Eng.
- 2000

ÐThe paper describes a new, logic-based methodology for analyzing observations. The key features of the Logical Analysis of Data (LAD) are the discovery of minimal sets of features necessary for… (More)

- Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
- Math. Program.
- 1997

- Lakhmi C. Jain, Endre Boros, +11 authors S. Misbah Deen
- Advanced Information Processing
- 2003

Future manufacturing, to stay competitive, should possess the capabilities to permit much faster response to changes in the business and technology environment. Companies should be able to transform… (More)

- Endre Boros, Yves Crama, Peter L. Hammer
- Annals of Mathematics and Artificial Intelligence
- 1990

This paper investigates the complexity of a general inference problem: given a propositional formula in conjunctive normal form, find all prime implications of the formula. Here, a prime implication… (More)

- Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
- Inf. Comput.
- 1998

In this paper, we address a fundamental problem related to the induction of Boolean logic: Given a set of data, represented as a set of binary “true n-vectors” (or “positive examples”) and a set of… (More)

- Tamás Badics, Endre Boros
- Math. Oper. Res.
- 1998

Since Å xi for binary variables, aiiÅ 0 could be assumed without any loss of generality. 2 x i It is well known that finding the minimum of f is an NP-hard problem (Garey and Johnson 1979); it… (More)

We show that generating all negative cycles of a weighted graph is a hard enumeration problem, in both the directed and undirected cases. More precisely, given a family of negative (directed) cycles,… (More)

We propose several efficient preprocessing techniques for Unconstrained Quadratic Binary Optimization (QUBO), including the direct use of enhanced versions of known basic techniques (e.g.,… (More)

- Endre Boros, Vladimir Gurvich
- Discrete Mathematics
- 1996

In this paper we prove that perfect graphs are kernel solvable, as it was conjectured by Berge and Duchet (1983). The converse statement, i.e. that kernel solvable graphs are perfect, was also… (More)