Pages that link to "Item:Q1959388"
From MaRDI portal
The following pages link to Exact OBDD bounds for some fundamental functions (Q1959388):
Displaying 9 items.
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- De Bruijn sequences and complexity of symmetric functions (Q662186) (← links)
- Lower bounds on the OBDD size of two fundamental functions' graphs (Q845898) (← links)
- The optimal read-once branching program complexity for the direct storage access function (Q963361) (← links)
- Computation of signal output probability for Boolean functions represented by OBDD (Q1767902) (← links)
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400) (← links)
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models (Q4265532) (← 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)