Abstract
Branching programs are a graphical representation of Boolean functions which are considered as a nonuniform model of computation in complexity theory and are also used as a data structure in practice. The talk discusses randomized variants of branching programs which allow to study the relative power of deterministic, nondeterministic, and randomized algorithms in a scenario where space is the primary resource.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Ablayev. Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams. In Proc. of th 24th Int. Coll. on Automata, Languages, and Programming (ICALP), LNCS 1256, 195–202. Springer, 1997.
F. Ablayev and M. Karpinski. On the power of randomized branching programs. In Proc. of the 23rd Int. Coll. on Automata, Languages, and Programming (ICALP), LNCS 1099, 348–356. Springer, 1996.
M. Ajtai. Determinism versus non-determinism for linear time RAMs with memory restrictions. In Proc. of the 31st Ann. ACM Symp. on Theory of Computing (STOC), 632–641, 1999.
M. Ajtai. A non-linear time lower bound for Boolean branching programs. In Proc. of the 40th IEEE Symp. on Foundations of Computer Science (FOCS), 60–70, 1999.
A. E. Andreev, A. E. F. Clementi, J. D. P. Rolim, and L. Trevisan. Weak random sources, hitting sets, and BPP simulations. In Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS), 264–272, 1997.
A. E. Andreev, A. E. F. Clementi, J. D. P. Rolim, and L. Trevisan. Weak random sources, hitting sets, and BPP simulations. SIAM J. Comp., 28(6):2103–2116, 1999.
P. Beame, M. Saks, X. Sun, and E. Vee. Super-linear time-space tradeoff lower bounds for randomized computation. In Proc. of the 41st IEEE Symp. on Foundations of Computer Science (FOCS), 2000.
P. Beame, M. Saks, and J. S. Thathachar. Time-space tradeoffs for branching programs. In Proc. of the 39th IEEE Symp. on Foundations of Computer Science (FOCS), 254–263, 1998.
A. Borodin, A. A. Razborov, and R. Smolensky. On lower bounds for read-k-times branching programs. Computational Complexity, 3:1–18, 1993.
A. Cobham. The recognition problem for the set of perfect squares. In Proc. of the 7th Symposium on Switching an Automata Theory (SWAT), 78–87, 1966.
R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proc. of the 29th Ann. ACM Symp. on Theory of Computing (STOC), 220–228, 1997.
K.-I. Ko. Some observations on the probabilistic algorithms and NP-hard problems. Information Processing Letters, 14(1):39–43, Mar. 1982.
E. A. Okol’nishnikova. On lower bounds for branching programs. Siberian Advances in Mathematics, 3(1):152–166, 1993.
P. Pudlák and S. Zák. Space complexity of computations. Technical report, Univ. Prague, 1983.
M. Sauerho.. Lower bounds for randomized read-k-times branching programs. In Proc. of the 15th Ann. Symp. on Theoretical Aspects of Computer Science (STACS), LNCS 1373, 105–115. Springer, 1998.
M. Sauerho.. Complexity Theoretical Results for Randomized Branching Programs. PhD thesis, Univ. of Dortmund. Shaker, Aachen, 1999.
M. Sauerho.. On the size of randomized OBDDs and read-once branching programs for k-stable functions. In Proc. of the 16th Ann. Symp. on Theoretical Aspects of Computer Science (STACS), LNCS 1563, 488–499. Springer, 1999. To appear in Computational Complexity.
M. Sauerho.. Approximation of Boolean functions by combinatorial rectangles. Technical Report 58, Electr. Coll. on Comp. Compl., 2000.
J. Thathachar. On separating the read-k-times branching program hierarchy. In Proc. of the 30th Ann. ACM Symp. on Theory of Computing (STOC), 653–662, 1998.
I. Wegener. On the complexity of branching programs and decision trees for clique functions. Journal of the ACM, 35(2):461–471, Apr. 1988.
I. Wegener. Branching Programs and Binary Decision Diagrams—Theory and Applications. Monographs on Discrete and Applied Mathematics. SIAM, Philadelphia, PA, 2000.
A. Wigderson. De-randomizing BPP: The state of the art. In Proc. of the 14th IEEE Int. Conf. on Computational Complexity, 1999.
S. Žák. An exponential lower bound for one-time-only branching programs. In Proc. of the 11th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), LNCS 176, 562–566. Springer, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sauerho., M. (2001). Randomized Branching Programs. In: Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2001. Lecture Notes in Computer Science, vol 2264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45322-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-45322-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43025-4
Online ISBN: 978-3-540-45322-2
eBook Packages: Springer Book Archive