On testing computability by small width OBDDs
From MaRDI portal
Recommendations
Cited in
(18)- Property testing lower bounds via a generalization of randomized parity decision trees
- An optimal tester for \(k\)-linear
- Second-order finite automata
- Exponentially improved algorithms and lower bounds for testing signed majorities
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs
- An optimal tester for k-Linear
- Lower Bounds for Testing Computability by Small Width OBDDs
- Testing computability by width-2 OBDDs where the variable order is unknown
- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
- Testing Computability by Width Two OBDDs
- On the minimization of (complete) ordered binary decision diagrams
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing
- Partially symmetric functions are efficiently isomorphism testable
- On approximating the number of relevant variables in a function
- Query learning of bounded-width OBDDs
- Query learning of bounded-width OBDDs
- Property testing lower bounds via communication complexity
- Testing computability by width-two OBDDs
This page was built for publication: On testing computability by small width OBDDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588436)