Geodesic
Branching programs provide lower bounds on the area of VLSI circuits
Kybernetika, Tome 27 (1991) no. 6, pp. 542-550.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

Classification : 68Q05, 68Q25, 68Q35 
@article{KYB_1991__27_6_a5,
     author = {Hromkovi\v{c}, Juraj},
     title = {Branching programs provide lower bounds on the area of {VLSI} circuits},
     journal = {Kybernetika},
     pages = {542--550},
     publisher = {mathdoc},
     volume = {27},
     number = {6},
     year = {1991},
     mrnumber = {1150942},
     zbl = {0746.68039},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1991__27_6_a5/}
}
TY  - JOUR
AU  - Hromkovič, Juraj
TI  - Branching programs provide lower bounds on the area of VLSI circuits
JO  - Kybernetika
PY  - 1991
SP  - 542
EP  - 550
VL  - 27
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/KYB_1991__27_6_a5/
LA  - en
ID  - KYB_1991__27_6_a5
ER  - 
%0 Journal Article
%A Hromkovič, Juraj
%T Branching programs provide lower bounds on the area of VLSI circuits
%J Kybernetika
%D 1991
%P 542-550
%V 27
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/KYB_1991__27_6_a5/
%G en
%F KYB_1991__27_6_a5
Hromkovič, Juraj. Branching programs provide lower bounds on the area of VLSI circuits. Kybernetika, Tome 27 (1991) no. 6, pp. 542-550. http://geodesic.mathdoc.fr/item/KYB_1991__27_6_a5/