Block-oriented programmable design with switching network interconnect
暂无分享,去创建一个
[1] Bruce M. Maggs,et al. Empirical evaluation of randomly-wire multistage networks , 1990, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[2] Ian Holyer,et al. The NP-Completeness of Some Edge-Partition Problems , 1981, SIAM J. Comput..
[3] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[4] Leslie G. Valiant,et al. On non-linear lower bounds in computational complexity , 1975, STOC.
[5] Robert K. Brayton,et al. Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.
[6] Oliver Vornberger,et al. The Complexity of Testing Whether a Graph is a Superconcentrator , 1981, Inf. Process. Lett..
[7] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[8] Chingwei Yeh,et al. A general purpose multiple way partitioning algorithm , 1991, DAC '91.
[9] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.