An upper bound for the circuit complexity of existentially quantified Boolean formulas

• Published in: Theoretical computer science Vol. 411; no. 31; pp. 2864 - 2870
• Main Authors: Kleine Büning, H., Remshagen, A.
• Format: Journal Article
• Language: English
• Published: Oxford Elsevier B.V 28.06.2010; Elsevier
• Subjects: Applied sciences; Boolean algebra; C (programming language); Circuits; Complexity; Computer science; control theory; systems; Constants; Equivalent circuits; Exact sciences and technology; Hierarchies; Logic and foundations; Mathematical analysis; Mathematical logic, foundations, set theory; Mathematical models; Mathematics; Miscellaneous; Quantified Boolean formulas; Recursion theory; Sciences and techniques of general use; Theoretical computing; Upper bounds; Quantified Boolean formulas; Circuits; Complexity; Upper bound; Maximum; Computer theory; Deficiency; Equivalent circuit; Circuit; Circuit complexity
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2010.04.017

The expressive power of existentially quantified Boolean formulas ∃ CNF with free variables is investigated. We introduce a hierarchy of subclasses ∃ MU ∗ ( k ) of ∃ CNF formulas based on the maximum deficiency k of minimal unsatisfiable subformulas of the bound part of the formulas. We will establish an upper bound of the size of minimally equivalent circuits. It will be shown, that there are constants a and b , such that for every formula in ∃ MU ∗ ( k ) of length m of the bound part and length l of the free part of the formula there is an equivalent circuit of size less than l + a ⋅ m b ( l o g 2 ( m ) + k ) 2 .