Exact OBDD Bounds for Some Fundamental Functions
From MaRDI portal
Recommendations
Cites work
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
- Branching Programs and Binary Decision Diagrams
- Communication Complexity
- Exact OBDD bounds for some fundamental functions
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 1011685 (Why is no real title available?)
- Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
- Reduction of OBDDs in linear time
Cited in
(14)- OBDDs of a monotone function and its prime implicants
- Size of ordered binary decision diagrams representing threshold functions
- Lower bounds for linearly transformed OBDDs and FBDDs
- Exact OBDD bounds for some fundamental functions
- scientific article; zbMATH DE number 1670823 (Why is no real title available?)
- Worst case examples for operations on OBDDs
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
- Least upper bounds on OBDD sizes
- scientific article; zbMATH DE number 1543030 (Why is no real title available?)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
- Size of OBDD representation of 2-level redundancies functions
- Lower bounds on the OBDD size of two fundamental functions' graphs
- On the size of (generalized) OBDDs for threshold functions
This page was built for publication: Exact OBDD Bounds for Some Fundamental Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448645)