Complexity of Identification and Dualization of Positive Boolean Functions

• Published in: Information and computation Vol. 123; no. 1; pp. 50 - 63
• Main Authors: Bioch, J.C., Ibaraki, T.
• Format: Journal Article
• Language: English
• Published: San Diego, CA Elsevier Inc 15.11.1995; Elsevier
• Subjects: Applied sciences; Computer science; control theory; systems; Exact sciences and technology; Logical, boolean and switching functions; Theoretical computing; Monotonic function; Computability and decidability; Boolean functions; Algorithms; Identification; Membership query; Complexity; Polynomial time
• ISSN: 0890-5401; 1090-2651
• DOI: 10.1006/inco.1995.1157

We consider in this paper the problem of identifying min T(ƒ) and max F(ƒ) of a positive (i.e., monotone) Boolean function ƒ, by using membership queries only, where min T(ƒ) (max F(ƒ)) denotes the set of minimal true vectors (maximal false vectors) of ƒ. It is shown that the existence of an incrementally polynomial algorithm for this problem is equivalent to the existence of the following algorithms, where ƒ and g are positive Boolean functions: • An incrementally polynomial algorithm to dualize ƒ; • An incrementally polynomial algorithm to self-dualize ƒ; • A polynomial algorithm to decide if ƒ and are mutually dual; • A polynomial algorithm to decide if ƒ is self-dual; • A polynomial algorithm to decide if ƒ is saturated; • A polynomial algorithm in |min (ƒ)| + |max (ƒ)| to identify min (ƒ) only. Some of these are already well known open problems in the respective fields. Other related topics, including various equivalent problems encountered in hypergraph theory and theory of coteries (used in distributed systems), are also discussed.