Skip to main content
SpringerLink
Log in

Lower bounds on the complexity of 1-time only branching programs (Preliminary version)

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.Borodin, D.Dolev, F.E.Fich, W.Paul. Bounds For Width-2 Branching Programs. Proceedings of 15th STOC, 1983, pp. 87–93.

    Google Scholar 

  2. A.Cobham. The Recognition Problem for the Set of Perfect Squares. 7th Symposium on SWAT, 1966, pp. 78–87.

    Google Scholar 

  3. W.Masek. A Fast Algorithm for the String Editing Problem and Decision Graph Complexity. Master Th., M.I.T.1976.

    Google Scholar 

  4. P.Pudlak. A Lower Bound on the Complexity Of Branching Programs. Univ. Of Prague, 1983.

    Google Scholar 

  5. I.Wegener. Optimal Decision Trees and 1-Time Only Branching Programs for Symmetric Boolean Functions. Proc. 9th CAAP, 1984.

    Google Scholar 

  6. I.Wegener. On the Complexity of Branching Programs and Decision Trees for Clique Functions. Univ. Of Frankfurt, May, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Of Computer Science, University Of Warwick, CV4 7AL, Coventry, Great Britain

    Paul. E. Dunne

Authors
  1. Paul. E. Dunne
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dunne, P.E. (1985). Lower bounds on the complexity of 1-time only branching programs (Preliminary version). In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028795

Download citation

  • DOI: https://doi.org/10.1007/BFb0028795

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation