Abstract
In this chapter we study another important computational model for boolean functions: branching programs, introduced by Lee [Lee59].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2000). Branching Programs. In: Thierauf, T. (eds) The Computational Complexity of Equivalence and Isomorphism Problems. Lecture Notes in Computer Science, vol 1852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45303-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-45303-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41032-4
Online ISBN: 978-3-540-45303-1
eBook Packages: Springer Book Archive