Size of ordered binary decision diagrams representing threshold functions

DOI10.1016/S0304-3975(97)83807-8zbMath0898.94018OpenAlexW1976629341MaRDI QIDQ1390857

T. Kaneda, K. Hosaka, Yasuhiko Takenaga, Shuzo Yajima

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)83807-8

zbMATH Keywords

Boolean functionthreshold functionsordered binary decision diagram

Mathematics Subject Classification ID

Related Items (10)

Theoretical insights and algorithmic tools for decision diagram-based optimization ⋮ Compact representation of near-optimal integer programming solutions ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Yet harder knapsack problems ⋮ Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores ⋮ Size of OBDD representation of 2-level redundancies functions ⋮ On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem ⋮ On the size of (generalized) OBDDs for threshold functions ⋮ On threshold BDDs and the optimal variable ordering problem ⋮ Non-clausal redundancy properties

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams
• On the OBDD-representation of general Boolean functions
• Finding the optimal variable ordering for binary decision diagrams
• A Lower Bound of the Number of Threshold Functions
• On Complete Sets of Logic Primitives

This page was built for publication: Size of ordered binary decision diagrams representing threshold functions