Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable FunctionsMartin Sauerhoff. STACS 1999: 488-499 [doi] On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching ProgramsBeate Bollig, Martin Sauerhoff, Ingo Wegener. cocoon 2001: 172-183 [doi] On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching ProgramsBeate Bollig, Martin Sauerhoff, Ingo Wegener. iandc, 178(1):263-278, 2002. [doi] Randomness versus Nondeterminism for Read-Once and Read- k Branching ProgramsMartin Sauerhoff. STACS 2003: 307-318 [doi]
The following publications are possibly variants of this publication: