Pages that link to "Item:Q3722429"
From MaRDI portal
The following pages link to Optimal decision trees and one-time-only branching programs for symmetric Boolean functions (Q3722429):
Displaying 13 items.
- Properties of complexity measures for PRAMs and WRAMs (Q580980) (← links)
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- The optimal read-once branching program complexity for the direct storage access function (Q963361) (← links)
- Time-space trade-offs for branching programs (Q1076517) (← links)
- Separating complexity classes related to \(\Omega\)-decision trees (Q1202936) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- Optimal ordered binary decision diagrams for read-once formulas (Q1570838) (← links)
- Coxeter groups and nonuniform complexity (Q1814266) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Lower bounds on the complexity of real-time branching programs (Q3815526) (← links)
- (Q4009550) (← links)
- On the relation between BDDs and FDDs (Q5096325) (← links)
- Exact OBDD Bounds for Some Fundamental Functions (Q5448645) (← links)
