Pages that link to "Item:Q1344625"
From MaRDI portal
The following pages link to Efficient data structures for Boolean functions (Q1344625):
Displaying 10 items.
- Completeness and non-completeness results with respect to read-once projections (Q1271310) (← links)
- A lower bound on branching programs reading some bits twice (Q1392030) (← links)
- A lower bound for integer multiplication on randomized ordered read-once branching programs. (Q1426006) (← links)
- On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q1854421) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- On the Influence of the State Encoding on OBDD-Representations of Finite State Machines (Q4256140) (← links)
- Randomization and nondeterminism are comparable for ordered read-once branching programs (Q4571952) (← links)
- On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q5047172) (← links)
- On BPP versus \(NP\cup coNP\) for ordered read-once branching programs (Q5941564) (← links)
