Skip to main content
SpringerLink
Log in

Optimal Free Binary Decision Diagrams for Computation of EARn

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2002 (MFCS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2420))

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 )

Institute for Theoretical Computer Science (ITI) is supported by Ministry of Education of Czech Republic as project LN00A056.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Article  MATH  MathSciNet  Google Scholar 

  2. Kriegel, K., Waack, S.: Lower bounds on the complexity of real-time branching programs. RAIRO — Theoretical Informatics and Applications 22 (1988) 447–459.

    MathSciNet  MATH  Google Scholar 

  3. Masek, W.: A fast algorithm for the string editing problem and decision graph complexity. M. Sc. Thesis, MIT (1976)

    Google Scholar 

  4. Savický, P., Žák, S.: A large lower bound for 1-branching programs. ECCC report 96-036 (1996)

    Google Scholar 

  5. 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

    Article  MATH  MathSciNet  Google Scholar 

  6. Wegener, I.: Branching Programs and Binary Decision Diagrams — Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications 4 (2000)

    Google Scholar 

  7. Wegener, I.: On the complexity of branching programs and decision trees for clique functions, Journal of the ACM 35 (1988) 461–471

    Article  MATH  MathSciNet  Google Scholar 

  8. Žá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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostranské náměstí 25, 118 00, Prague 1, Czech Republic

    Jan Kára & Daniel Král’

Authors
  1. Jan Kára
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Král’
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland

    Krzysztof Diks  & Wojciech Rytter  & 

  2. Department of Computer Science, Liverpool University, Peach Street, Liverpool, L69 7ZF, UK

    Wojciech Rytter

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation