Reduction of OBDDs in linear time
From MaRDI portal
Recommendations
Cites work
Cited in
(37)- The symbolic OBDD scheme for generating mechanical assembly sequences
- OBDDs of a monotone function and its prime implicants
- Efficient data structures for Boolean functions
- Efficient algorithms for the transformation between different types of binary decision diagrams
- A reducibility concept for problems defined in terms of ordered binary decision diagrams
- BDDs -- design, analysis, complexity, and applications.
- Exponential space complexity for OBDD-based reachability analysis
- On the descriptive and algorithmic power of parity ordered binary decision diagrams
- Using ordered binary decision diagrams to factorize multi-level logic
- Non-clausal redundancy properties
- Minimization problems for parity OBDDs
- Priority functions for the approximation of the metric TSP
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
- Bounds on the OBDD-size of integer multiplication via universal hashing
- Parity OBDDs cannot be handled efficiently enough
- scientific article; zbMATH DE number 2084329 (Why is no real title available?)
- Binary decision diagrams
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
- An nlogn Algorithm for Online BDD Refinement
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- scientific article; zbMATH DE number 2077136 (Why is no real title available?)
- Linear temporal logic symbolic model checking
- On the descriptive and algorithmic power of parity ordered binary decision diagrams
- A reducibility concept for problems defined in terms of ordered binary decision diagrams
- On the hardness of approximating the minimum consistent OBDD problem
- On the relation between BDDs and FDDs (extended abstract)
- On the complexity of constructing optimal ordered binary decision diagrams
- Exact OBDD Bounds for Some Fundamental Functions
- Larger lower bounds on the OBDD complexity of integer multiplication
- STACS 2005
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
- String-matching with OBDDs
- OBDDs of a monotone function and of its prime implicants
- The I/O-complexity of Ordered Binary-Decision Diagram manipulation
- Graph driven BDDs -- a new data structure for Boolean functions
- Weighted A^* search - unifying view and application
- On the size of (generalized) OBDDs for threshold functions
This page was built for publication: Reduction of OBDDs in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313758)
