Login / Signup

On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution.

Yu-Liang WuDouglas Chang
Published in: ICCAD (1994)
Keyphrases