The following pages link to Endre Boros (Q226794):
Displaying 50 items.
- Perfect graphs are kernel solvable (Q1126176) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- The existence of non-trivial hyperfactorizations of \(K_{2n}\) (Q1180405) (← links)
- Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization (Q1276959) (← links)
- Horn minimization by iterative decomposition (Q1277344) (← links)
- Stable families of coalitions and normal hypergraphs (Q1277475) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
- On perfect \(0,\pm 1\) matrices (Q1356731) (← links)
- Powers of circulants in bottleneck algebra (Q1359181) (← links)
- Logical analysis of numerical data (Q1365054) (← links)
- A corrected version of the Duchet kernel conjecture (Q1377724) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- Variations on extending partially defined Boolean functions with missing bits. (Q1400581) (← links)
- On maximal frequent and minimal infrequent sets in binary matrices (Q1404408) (← links)
- Finding essential attributes from binary data (Q1404409) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (Q1414826) (← links)
- Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices (Q1424303) (← links)
- Logical analysis of binary data with missing bits (Q1606295) (← links)
- Strong duality in Horn minimization (Q1679964) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim} (Q1706111) (← links)
- Separable discrete functions: recognition and sufficient conditions (Q1732758) (← links)
- A three-person deterministic graphical game without Nash equilibria (Q1752440) (← links)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
- Stable matchings in three-sided systems with cyclic preferences (Q1763331) (← links)
- Maximal intersecting families and affine regular polygons in \(PG(2,q)\) (Q1812686) (← links)
- On a linear diophantine problem for geometrical type sequences (Q1820807) (← links)
- On the number of vertices belonging to all maximum stable sets of a graph (Q1850112) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (Q1885808) (← links)
- Decomposability of partially defined Boolean functions (Q1900137) (← links)
- Boolean regression (Q1904716) (← links)
- Unconstrained multilayer switchbox routing (Q1904736) (← links)
- On the number of flats spanned by a set of points in \(PG(d,q)\) (Q1916131) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- Stable effectivity functions and perfect graphs (Q1974051) (← links)
- Diagnosing double regular systems (Q1978022) (← links)
- Generating clause sequences of a CNF formula (Q2219060) (← links)
- On the Sprague-Grundy function of extensions of proper \textsc{nim} (Q2230540) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- On effectivity functions of game forms (Q2268107) (← links)
- Compact quadratizations for pseudo-Boolean functions (Q2307493) (← links)
- Decomposing 1-Sperner hypergraphs (Q2315439) (← links)
- On graphs whose maximal cliques and stable sets intersect (Q2315571) (← links)
- Sprague-Grundy function of matroids and related hypergraphs (Q2333808) (← links)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
