Decompositions of Boolean functions and hypergraphs

Boolean functions are closely reltated to hypergraphs. In fact, Ibaraki and Kameta (1993) sutudied relations between coteries (intersecting simple hypergraphs) and positive Boolean functions. In this paper, we shall show that the set of all simple hypergraphs is lattice-isomorphic to the set of all positive Boolean functions. A decompositions of a given function into a conjunction of self-dual functions were studied by Ibaraki, Kameta (1993) and Bioch, Ibaraki (1995). For a given dual-minor function, using a certain corresponding hypergraph, we shall give the general condition for the decomposition.

公開日:2010年1月24日で登録したコンテンツは、国立情報学研究所において電子化したものです。