On Dualization over Distributive Lattices

@article{Elbassioni2020OnDO,
  title={On Dualization over Distributive Lattices},
  author={Khaled M. Elbassioni},
  journal={ArXiv},
  year={2020},
  volume={abs/2006.15337}
}
Given a partially order set (poset) $P$, and a pair of families of ideals $\mathcal{I}$ and filters $\mathcal{F}$ in $P$ such that each pair $(I,F)\in \mathcal{I}\times\mathcal{F}$ has a non-empty intersection, the dualization problem over $P$ is to check whether there is an ideal $X$ in $P$ which intersects every member of $\mathcal{F}$ and does not contain any member of $\mathcal{I}$. Equivalently, the problem is to check for a distributive lattice $L=L(P)$, given by the poset $P$ of its set… 

Figures from this paper

References

SHOWING 1-10 OF 18 REFERENCES

Dualization in lattices given by ordered sets of irreducibles

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

It is shown that for an arbitrary hypergraph the families of multiple and partial transversals are both dual-bounded in the sense that the size of the corresponding dual hypergraph is bounded by a polynomial in the cardinality and the length of description of the input hypergraph.

On the complexity of monotone dualization and generating minimal hypergraph transversals

Dualization in lattices given by implicational bases

It is shown using hypergraph dualization that the problem can be solved in output quasi-polynomial time whenever the implicational base has bounded independent-width, defined as the size of a maximum set of implications having independent conclusions.

Complexity of Identification and Dualization of Positive Boolean Functions

It is shown that the existence of an incrementally polynomial algorithm for this problem is equivalent to the exist of the following algorithms, where ƒ and g are positive Boolean functions.

Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

It is shown that it is possible to apply ideas of Paull and Unger and of Tsukiyama et al. to obtain polynomial-time algorithms for a number of special cases, e.g. the efficient generation of all maximal feasible solutions to a knapsack problem.