Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Pseudo-Boolean optimization

This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. The… Expand

An Implementation of Logical Analysis of Data

- E. Boros, P. Hammer, T. Ibaraki, A. Kogan, E. Mayoraz, I. Muchnik
- Computer Science
- IEEE Trans. Knowl. Data Eng.
- 1 March 2000

Describes a new, logic-based methodology for analyzing observations. The key features of this "logical analysis of data" (LAD) methodology are the discovery of minimal sets of features that are… Expand

Logical analysis of numerical data

- E. Boros, P. Hammer, T. Ibaraki, A. Kogan
- Computer Science, Mathematics
- Math. Program.
- 1 October 1997

Abstract“Logical analysis of data” (LAD) is a methodology developed since the late eighties, aimed at discovering hidden structural information in data sets. LAD was originally developed for… Expand

Minimization of Half-Products

- Tamás Badics, E. Boros
- Computer Science, Mathematics
- Math. Oper. Res.
- 1 March 1998

In this paper a special class of quadratic functions, the so called half-products are considered. It is shown that while the minimization over the set of binary n-vectors for half-products is… Expand

Preprocessing of unconstrained quadratic binary optimization

- E. Boros, P. Hammer, Gabriel Tavares
- Computer Science
- 2006

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.,… Expand

- 80
- 14

Generating All Vertices of a Polyhedron Is Hard

- L. Khachiyan, E. Boros, K. Borys, Khaled M. Elbassioni, V. Gurvich
- Mathematics, Computer Science
- SODA '06
- 4 March 2008

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,… Expand

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction

- L. Khachiyan, E. Boros, +4 authors Jihui Zhao
- Mathematics, Computer Science
- Theory of Computing Systems
- 7 April 2008

Abstract
Given a directed graph G=(V,A) with a non-negative weight (length) function on its arcs w:A→ℝ+ and two terminals s,t∈V, our goal is to destroy all short directed paths from s to t in G by… Expand

The number of triangles covering the center of an n-set

Let the points P1, P2, ..., Pnbe given in the plane such that there are no three on a line. Then there exists a point of the plane which is contained in at least n3/27 (open) PiPjPktriangles. This… Expand

Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions

- E. Boros, T. Ibaraki, K. Makino
- Computer Science, Mathematics
- Inf. Comput.
- 1 February 1998

Abstract 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 “truen-vectors” (or “positive examples”) and a… Expand

Polynomial-time inference of all valid implications for Horn and related formulae

- E. Boros, Y. Crama, P. Hammer
- Mathematics, Computer Science
- Annals of Mathematics and Artificial Intelligence
- 1 September 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… Expand