Pages that link to "Item:Q3588436"
From MaRDI portal
The following pages link to On Testing Computability by Small Width OBDDs (Q3588436):
Displaying 12 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)
- Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
- An optimal tester for \(k\)-linear (Q2154097) (← links)
- Second-order finite automata (Q2158302) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- An optimal tester for \(k\)-Linear (Q2690878) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Partially Symmetric Functions Are Efficiently Isomorphism Testable (Q5252692) (← links)
- On Approximating the Number of Relevant Variables in a Function (Q5894227) (← links)
