On The Np-completeness Of Regular 2-d Fpga Routing Architectures And A Novel Solution | IEEE Conference Publication | IEEE Xplore