Lower bounds on the complexity of real-time branching programs
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 4, pp. 447-459.

Voir la notice de l'article dans Numdam

@article{ITA_1988__22_4_447_0,
     author = {Kriegel, Klaus and Waack, Stephan},
     title = {Lower bounds on the complexity of real-time branching programs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {447--459},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {4},
     year = {1988},
     zbl = {0664.68046},
     mrnumber = {984586},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/ITA_1988__22_4_447_0/}
}
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
SP  - 447
EP  - 459
VL  - 22
IS  - 4
PB  - EDP-Sciences
UR  - https://geodesic-test.mathdoc.fr/item/ITA_1988__22_4_447_0/
LA  - en
ID  - ITA_1988__22_4_447_0
ER  - 
%0 Journal Article
%A Kriegel, Klaus
%A Waack, Stephan
%T Lower bounds on the complexity of real-time branching programs
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1988
%P 447-459
%V 22
%N 4
%I EDP-Sciences
%U https://geodesic-test.mathdoc.fr/item/ITA_1988__22_4_447_0/
%G en
%F ITA_1988__22_4_447_0
Kriegel, Klaus; Waack, Stephan. Lower bounds on the complexity of real-time branching programs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 4, pp. 447-459. https://geodesic-test.mathdoc.fr/item/ITA_1988__22_4_447_0/