Abstract
Free binary decision diagrams (FBDDs) are graph-based data structures representing Boolean functions with a constraint (additional to binary decision diagrams) that each variable is tested during the computation at most once. The function EARn is a Boolean function on n×n Boolean matrices; EARn(M) = 1 iff the matrix M contains two equal adjacent rows. We prove that the size of optimal FBDDs computing EARn is 2⊖(log2 n )
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Institute for Theoretical Computer Science (ITI) is supported by Ministry of Education of Czech Republic as project LN00A056.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Babai, L., Hajnal, P., Szemerédi, E., Turán, G.: A lower bound for read-once only branching programs. Journal of Computer and System Sciences 35 (1987) 153–162
Kriegel, K., Waack, S.: Lower bounds on the complexity of real-time branching programs. RAIRO — Theoretical Informatics and Applications 22 (1988) 447–459.
Masek, W.: A fast algorithm for the string editing problem and decision graph complexity. M. Sc. Thesis, MIT (1976)
Savický, P., Žák, S.: A large lower bound for 1-branching programs. ECCC report 96-036 (1996)
Savický, P., Žák, S.: A read-once lower bound and (1,+k)-hierarchy for branching programs. Theoretical Computer Science 238(1–2) (2000) 347–362
Wegener, I.: Branching Programs and Binary Decision Diagrams — Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications 4 (2000)
Wegener, I.: On the complexity of branching programs and decision trees for clique functions, Journal of the ACM 35 (1988) 461–471
Žák, S.: An exponential lower bound for one-time-only branching programs. Proc. 11th International Symposium on Mathematical Foundations of Computer Science 1984, LNCS vol. 176 (1984) 562–566
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kára, J., Král’, D. (2002). Optimal Free Binary Decision Diagrams for Computation of EARn . In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_34
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive