A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
From MaRDI portal
Publication:4386450
DOI10.1006/jagm.1997.0896zbMath0894.68068OpenAlexW2038915642MaRDI QIDQ4386450
Toshihide Ibaraki, Kazuhisa Makino
Publication date: 23 June 1998
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1997.0896
Related Items (9)
Dual-bounded generating problems: Weighted transversals of a hypergraph ⋮ Enumerating minimal dominating sets in chordal bipartite graphs ⋮ Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets ⋮ Computational aspects of monotone dualization: a brief survey ⋮ On the complexity of monotone dualization and generating minimal hypergraph transversals ⋮ Generating dual-bounded hypergraphs ⋮ Guided inference of nested monotone Boolean functions ⋮ Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
This page was built for publication: A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
