DocumentCode :
3290700
Title :
On The Np-completeness Of Regular 2-d Fpga Routing Architectures And A Novel Solution
Author :
Wu, Yu-Liang ; Chang, Douglas
fYear :
1994
fDate :
6-10 Nov 1994
Firstpage :
362
Lastpage :
366
Keywords :
Circuit optimization; Computer architecture; Field programmable gate arrays; Intrusion detection; Logic; Polynomials; Prediction algorithms; Routing; Switches; Wire;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer-Aided Design, 1994., IEEE/ACM International Conference on
ISSN :
1063-6757
Print_ISBN :
0-8186-3010-8
Type :
conf
DOI :
10.1109/ICCAD.1994.629819
Filename :
629819
Link To Document :
بازگشت