Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2000: Mathematical Foundations of Computer Science 2000 pp 650–659Cite as

A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism

Extended Abstract

  • Conference paper
  • First Online:

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

Abstract

Restricted branching programs are considered in complexity theory in order to study the space complexity of sequential computations and in applications as a data structure for Boolean functions. In this paper (⊕, k)-branching programs and (∨, k)-branching programs are considered, i.e., branching programs starting with a ⊕- (or ∨-)node with a fan-out of k whose successors are k read-once branching programs. This model is motivated by the investigation of the power of nondeterminism in branching programs and of similar variants that have been considered as a data structure. Lower bound methods for these variants of branching programs are presented, which allow to prove even hierarchy results for polynomial size (⊕, k)- and (∨, k)-branching programs with respect to k.

Supported by GA CR grant 201/98/0717.

Supported in part by DFG grant We 1066/9.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai, M. (1999). A non-linear time lower bound for Boolean branching programs. In Proc. of 40th Symposium on Foundations of Computer Science, 60–70.

    Google Scholar 

  2. Bollig, B. and Wegener, I. (1999). Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams. Theory of Computing Systems 32, 487–503.

    Article  MATH  MathSciNet  Google Scholar 

  3. Borodin, A., Razborov, A. and Smolensky, R. (1993). On lower bounds for read-k-times branching programs. Computational Complexity 3, 1–18.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Jain, J., Bitner, J., Fussell, D.S. and Abraham, J.A. (1992). Functional partitioning for verification and related problems. Brown MIT VLSI Conference, 210–226.

    Google Scholar 

  6. Jukna, S. (1988). Entropy of contact circuits and lower bounds on their complexity. Theoretical Computer Science 57, 113–129.

    Article  MATH  MathSciNet  Google Scholar 

  7. 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, Springer, Lecture Notes in Computer Science 1295, 319–326.

    Chapter  Google Scholar 

  8. Krause, M. (1990). Separating ⊕L from L, NL, co-NL and AL (= P) for oblivious Turing machines of linear access time. In Proc. of Mathematical Foundations of Computer Science, Springer, Lecture Notes in Computer Science 452, 385–391.

    Chapter  Google Scholar 

  9. Krause, M., Meinel, C. and Waack, S. (1991). Separating the eraser Turing machine classes L e, NL e, co-NL e and P e. Theoretical Computer Science 86, 267–275.

    Article  MATH  MathSciNet  Google Scholar 

  10. Meinel, C. (1990). Polynomial size Ω-branching programs and their computational power. Information and Computation 85, 163–182.

    Article  MATH  MathSciNet  Google Scholar 

  11. Razborov, A. A. (1991). Lower bounds for deterministic and nondeterministic branching programs. In Proc. of Fundamentals in Computing Theory, Springer, Lecture Notes in Computer Science 529, 47–60.

    Google Scholar 

  12. Sauerhoff, M. (1999). An improved hierarchy result for partitioned BDDs. To appear in Theory of Computing Systems.

    Google Scholar 

  13. Sauerhoff, M. (1999). Computing with restricted nondeterminism: the dependence of the OBDD size on the number of nondeterministic variables. In Proc. of 19th Conference on Foundations of Software Technology and Theoretical Computer Science, Springer, Lecture Notes in Computer Science 1738, 342–355.

    Chapter  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  15. Wegener, I. (2000). Branching Programs and Binary Decision Diagrams—Theory and Applications. SIAM Monographs on Discrete Mathematics and Its Applications, in print.

    Google Scholar 

  16. Žák, S. (1984). An exponential lower bound for one-time-only branching programs. In Proc. of Mathematical Foundations of Computer Science, Springer, Lecture Notes in Computer Science 176, 562–566.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Academy of Sciences of Czech Republic, Prague, Czech Republic

    Petr Savický

  2. FB Informatik, Universität Dortmund, LS 2, 44221, Dortmund, Germany

    Detlef Sieling

Authors
  1. Petr Savický
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 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, University of Aarhus, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. Department of Computer Sciene, Comenius University, 84248, Bratislava, Slovakia

    Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Savický, P., Sieling, D. (2000). A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-44612-5_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67901-1

  • Online ISBN: 978-3-540-44612-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation