Pages that link to "Item:Q764366"
From MaRDI portal
The following pages link to Testing computability by width-two OBDDs (Q764366):
Displaying 6 items.
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- Testing Computability by Width Two OBDDs (Q3638913) (← links)
- Functions that have read‐twice constant width branching programs are not necessarily testable (Q4459589) (← links)