On the size of randomized OBDDs and read-once branching programs for k-stable functions

Martin Sauerhoff. On the size of randomized OBDDs and read-once branching programs for k-stable functions. Computational Complexity, 10(2):155-178, 2001. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.