Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1999: Foundations of Software Technology and Theoretical Computer Science pp 356–368Cite as

Lower Bounds for Linear Transformed OBDDs and FBDDs

(Extended Abstract)

  • Conference paper
  • First Online:

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

Abstract

Linear Transformed OBDDs (LTOBDDs)h ave been suggested as a generalization of OBDDs for the representation and manipulation of Boolean functions. Instead of variables as in the case of OBDDs parities of variables may be tested at the nodes of an LTOBDD. By this extension it is possible to represent functions in polynomial size that do not have polynomial size OBDDs, e.g., the characteristic functions of linear codes. In this paper lower bound methods for LTOBDDs and some generalizations of LTOBDDs are presented and applied to explicitly defined functions. By the lower bound results it is possible to compare the set of functions with polynomial size LTOBDDs and their generalizations with the set of functions with polynomial size representations for many other restrictions of BDDs.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aborhey, S. (1988). Binary decision tree test functions. IEEE Transactions on Computers 37, 1461–1465. 357

    Article  MATH  MathSciNet  Google Scholar 

  2. Bern, J., Meinel, C. and Slobodová, A. (1995). Efficient OBDD-based Boolean manipulation in CAD beyond current limits. In Proc. of 32nd Design Automation Conference, 408–413. 357

    Google Scholar 

  3. Bryant, R.E. (1986). Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35, 677–691. 356

    Article  MATH  Google Scholar 

  4. Dietzfelbinger, M. and Savický, P. (1997). Parity OBDDs cannot represent the multiplication succinctly. Preprint Universität Dortmund. 362

    Google Scholar 

  5. Gergov, J. and Meinel, C. (1996). Mod-2-OBDDs-a data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams. Formal Methods in System Design 8, 273–282. 360

    Article  Google Scholar 

  6. Günther, W. and Drechsler, R. (y1998). BDD minimization by linear transformations. In Proc. of Advanced Computer Systems, Szczecin, Poland, 525–532. 366

    Google Scholar 

  7. Günther, W. and Drechsler, R. (1998). Linear transformations and exact minimization of BDDs. In Proc. of IEEE Great Lakes Symposium on VLSI, 325–330. 357

    Google Scholar 

  8. Hromkovič, J. (1997). Communication Complexity and Parallel Computing. Springer. 362

    Google Scholar 

  9. Jukna, S. (1995). A note on read-k times branching programs. RAIRO Theoretical Informatics and Applications 29, 75–83. 358

    MATH  MathSciNet  Google Scholar 

  10. Jukna, S. (1999). Linear codes are hard for oblivious read-once parity branching programs. Information Processing Letters 69, 267–269. 358

    Article  MATH  MathSciNet  Google Scholar 

  11. Jukna, S. and Razborov, A. (1998). Neither reading few bits twice nor reading illegally helps much. Discrete Applied Mathematics 85, 223–238. 358

    Article  MATH  MathSciNet  Google Scholar 

  12. Jukna, S., Razborov, A., Savický, P. and Wegener, I. (1997). On P versus NP ∩co-NP for decision trees and read-once branching programs. In Proc. of Mathematical Foundations of Computer Science, LNCS 1295, 319–326. 360

    Chapter  Google Scholar 

  13. Kushilevitz, E. and Nisan, N. (1997). Communication Complexity. Cambridge University Press. 362

    Google Scholar 

  14. Meinel, C., Somenzi, F. and Theobald, T. (1997). Linear sifting of decision diagrams. In Proc. of 34th Design Automation Conference, 202–207. 357

    Google Scholar 

  15. Okol’nishnikova, E.A. (1991). On lower bounds for branching programs. Metody Diskretnogo Analiza 51, 61–83 (in Russian). English Translation in Siberian Advances in Mathematics 3, 152-166, 1993. 358

    MathSciNet  Google Scholar 

  16. Razborov, A.A. (1991). Lower bounds for deterministic and nondeterministic branching programs. In Proc. of Fundamentals of Computing Theory, LNCS 529, 47–60. 356

    Google Scholar 

  17. Sieling, D. (1999). Lower bounds for linear transformed OBDDs and FBDDs. Preprint Universität Dortmund. 359

    Google Scholar 

  18. Waack, S. (1997). On the descriptive and algorithmic power of parity ordered binary decision diagrams. In Proc. of Symposium on Theoretical Aspects of Computer Science, LNCS 1200, 201–212. 360

    Google Scholar 

  19. Wegener, I. (1988). On the complexity of branching programs and decision trees for clique functions. Journal of the Association for Computing Machinery 35, 461–471. 360

    MATH  MathSciNet  Google Scholar 

  20. Žák, S. (1984). An exponential lower bound for one-time-only branching programs. In Proc. of Mathematical Foundations of Computer Science, LNCS 176, 562–566. 360

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, LS 2, Univ. Dortmund, 44221, Dortmund, Germany

    Detlef Sieling

Authors
  1. Detlef Sieling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, 600036, India

    C. Pandu Rangan

  2. Institute of Mathematical Sciences C.I.T. Campus, Chennai, 600113, India

    V. Raman  & R. Ramanujam  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sieling, D. (1999). Lower Bounds for Linear Transformed OBDDs and FBDDs. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-46691-6_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66836-7

  • Online ISBN: 978-3-540-46691-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation