The following pages link to Reduction of OBDDs in linear time (Q1313758):
Displaying 28 items.
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Larger lower bounds on the OBDD complexity of integer multiplication (Q553298) (← links)
- String-matching with OBDDs (Q596086) (← links)
- Graph driven BDDs -- a new data structure for Boolean functions (Q673788) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- On the size of (generalized) OBDDs for threshold functions (Q987805) (← links)
- The symbolic OBDD scheme for generating mechanical assembly sequences (Q1028726) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q1364133) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Exponential space complexity for OBDD-based reachability analysis (Q1675755) (← links)
- On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q1854421) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- Minimization problems for parity OBDDs (Q2272213) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
- Binary Decision Diagrams (Q3176365) (← links)
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem (Q3599068) (← links)
- On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q5047172) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- On the relation between BDDs and FDDs (Q5096325) (← links)
- On the complexity of constructing optimal ordered binary decision diagrams (Q5096910) (← links)
- Exact OBDD Bounds for Some Fundamental Functions (Q5448645) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)
- The I/O-complexity of Ordered Binary-Decision Diagram manipulation (Q6487949) (← links)
