Lower bounds on the complexity of real-time branching programs

Klaus Kriegel; Stephan Waack

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1988)

  • Volume: 22, Issue: 4, page 447-459
  • ISSN: 0988-3754

How to cite

top

Kriegel, Klaus, and Waack, Stephan. "Lower bounds on the complexity of real-time branching programs." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 22.4 (1988): 447-459. <http://eudml.org/doc/92316>.

@article{Kriegel1988,
author = {Kriegel, Klaus, Waack, Stephan},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {decision graph complexity; Dyck language; lower bounds; branching programs},
language = {eng},
number = {4},
pages = {447-459},
publisher = {EDP-Sciences},
title = {Lower bounds on the complexity of real-time branching programs},
url = {http://eudml.org/doc/92316},
volume = {22},
year = {1988},
}

TY - JOUR
AU - Kriegel, Klaus
AU - Waack, Stephan
TI - Lower bounds on the complexity of real-time branching programs
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1988
PB - EDP-Sciences
VL - 22
IS - 4
SP - 447
EP - 459
LA - eng
KW - decision graph complexity; Dyck language; lower bounds; branching programs
UR - http://eudml.org/doc/92316
ER -

References

top
  1. 1. M. AJTAI, L. BABAI, P. HAJNAL, J. KOMLOS, P. PUDLAK, V. RÖDEL, E. SZEMEREDI and G. TURAN, Two lower bounds for branching programs, 18th ACM STOC, 1986, pp. 30-39. 
  2. 2. A. BORODIN, D. DOLEV, F. E. FICH and W. PAUL, Bounds for width two branching programs, 15th ACM STOC, 1983, pp. 87-93. Zbl0589.68034
  3. 3. L. BUDACH, Lower bounds for the number of nodes in a decision tree, EIK 21, 1985, No 4/5, pp.221-228. MR824578
  4. 4. A. K. CHANDRA, M. L. FURST and R. J. LIPTON, Multiparty protocols, 15th ACM STOC, 1983, pp.94-99. 
  5. 5. P. E. DUNNE, Lower bounds on the complexity of 1-time-only branching programs, FCT Proc., Lect. Notes in Comp. Sci.,Vol. 199, 1985, pp. 90-99. Zbl0575.68064MR821228
  6. 6. R. J. LIPTON and Y. ZALCSTEIN, Word problems solvable in logspace, Journal of the ACM, Vol. 24, No.3, 1977, pp. 522-526. Zbl0359.68049MR445901
  7. 7. E. I. NECHIPORUK, On a Boolean function, Dokl. Akad. Nauk USSR, Vol. 169, No. 4, 1966, pp.765-766. Zbl0161.00901MR218148
  8. 8. P. PUDLAK, A lower bound on the complexity of branching programs, Preprint, Univ. Prague, 1983. Zbl0572.68033MR783479
  9. 9. U. VISHKIN and A. WIGDERSON, Trode-offs between depth and width in parallel computation, SIAM J. Comput, Vol. 14, No.2, 1985, pp. 303-314. Zbl0573.68015MR784739
  10. 10. I. WEGENER, On the complexity of branching programs and decision trees for clique fonctions, Univ. of Frankfurt, Fachbereich Informatik, Interner Bericht, 5/84, 1984. 
  11. 11. A. C. YAO, Lower bounds by probabilistic arguments, 24th IEEE FOCS, 1983, pp. 420-428. 
  12. 12. S. ZAK, An exponential lower bound for one-time-only branching programs, MFCS Proc., Lect. Notes in Comp. Sci., Vol. 176, 1984, pp. 562-566. Zbl0558.68044MR783488
  13. 13. S. ZAK, An exponential lower bound for real-time branching programs, manuscript. Zbl0627.68044

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.