On the complexity of the hidden weighted bit function for various BDD models

Ordered binary decision diagrams (OBDDs) and several more general BDD models have turned out to be representations of Boolean functions which are useful in applications like verification, timing analysis, test pattern generation or combinatorial optimization. The hidden weighted bit function (HWB) is of particular interest, since it seems to be the simplest function with exponential OBDD size. The complexity of this function with respect to different circuit models, formulas, and various BDD models is discussed.

[1]  Vojtech Rödl,et al.  Lower Bounds to the Complexity of Symmetric Boolean Functions , 1990, Theor. Comput. Sci..

[2]  Randal E. Bryant,et al.  On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication , 1991, IEEE Trans. Computers.

[3]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[4]  A. Sangiovanni-Vincentelli,et al.  Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions , 1996, ICCAD 1996.

[5]  Noam Nisan,et al.  On Randomized One-round Communication Complexity , 1995, STOC '95.

[6]  Jacob A. Abraham,et al.  Probabilistic verification of Boolean functions , 1992, Formal Methods Syst. Des..

[7]  Martin Sauerhoff.  On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions , 1999, STACS.

[8]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[9]  Juraj Hromkovic,et al.  Communication Complexity and Parallel Computing , 1997, Texts in Theoretical Computer Science An EATCS Series.

[10]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[11]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[12]  Rolf Drechsler,et al.  On the Relation between BDDs and FDDs , 1995, Inf. Comput..

[13]  Thomas Hofmeister,et al.  Some Notes on Threshold Circuits, and Multiplication in Depth 4 , 1991, Inf. Process. Lett..

[14]  Farid M. Ablayev.  Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs , 1997, ICALP.

[15]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[16]  M. Agrawal,et al.  The Satisfiability Problem for Probabilistic Ordered Branching Programs , 2001, Theory of Computing Systems.

[17]  Thomas Hofmeister,et al.  Some Notes on Threshold Circuits, and Multiplication in Depth 4 , 1991, Inf. Process. Lett..

[18]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[19]  Stephan Waack.  On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams , 1997, STACS.

[20]  Martin Sauerhoff,et al.  Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract) , 1998, STACS.

[21]  Christoph Meinel,et al.  Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams , 1996, Formal Methods Syst. Des..

[22]  Marek Karpinski,et al.  On the Power of Randomized Branching Programs , 1996, ICALP.

[23]  Leslie G. Valiant,et al.  Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.

[24]  Ingo Wegener,et al.  The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours , 1998, Formal Methods Syst. Des..

[25]  Ingo Wegener,et al.  Graph Driven BDDs - A New Data Structure for Boolean Functions , 1995, Theor. Comput. Sci..

[26]  Martin Sauerhoff,et al.  Complexity theoretical results for randomized branching programs , 1999 .

[27]  Ingo Wegener,et al.  The Complexity of Symmetric Boolean Functions , 1987, Computation Theory and Logic.