Pages that link to "Item:Q3638913"
From MaRDI portal
The following pages link to Testing Computability by Width Two OBDDs (Q3638913):
Displaying 7 items.
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Testing computability by width-two OBDDs (Q764366) (← links)
- Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
- Second-order finite automata (Q2158302) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- Functions that have read‐twice constant width branching programs are not necessarily testable (Q4459589) (← links)