Pages that link to "Item:Q3010413"
From MaRDI portal
The following pages link to Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413):
Displaying 5 items.
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Testing computability by width-two OBDDs (Q764366) (← links)
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
