Author:
Gergov Jordan,Meinel Christoph
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Theoretical Computer Science,Software
Reference28 articles.
1. M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlak, V. Rödl, E. Szemeredi, and G. Turan, “Two lower bounds for branching programs,”Proc. 18th ACM STOC, 1986, pp. 30–38.
2. B. Becker, “Synthesis for testability: Binary decision diagrams,”Proc. of 9th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, February 1992, Vol 577, pp. 501–512.
3. B. Becker and R. Drechsler,On the Computational Power of Functional Decision Diagrams, Interner Bericht 5/93, Universität Frankfurt, 1993.
4. M.Blum, A.K.Chandra, and M.N.Wegman, “Equivalence of free boolean graphs can be decided probabilistically in polynomial time,”IPL 10, Vol. 2, pp. 80–82, 1980.
5. S.D. Brown, R.J. Francis, J. Rose, and Z.G. Vranesic,Field-Programmable Gate Arrays, Kluwer Academic Publisher, 1992.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献