Author:
Iwama Kazuo,Okabe Yasuo,Takase Toshiro
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Lect Notes Comput Sci;F. Ablayev,1997
2. M. Ajtai “A Non-linear Time Lower Bound for Boolean Branching Programs” Proc.40th IEEE FOCS, pp.60–69, 1999.
3. Lect Notes Comput Sci;F. Ablayev,1996
4. N. Alon, and W. Maas, “Meanders, Ramsey theory and lower bound for branching programs” Proc.27th IEEE FOCS, pp.410–417, 1986.
5. R. Bryant, “On the complexity of VLSI implementations and graph representations of Boolean function with application to integer multiplication.” IEEE Trans. Computers, C-40(2), pp. 205–213, 1991.