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

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

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

Identifier:nobleid.org/w1/20260515/09F2C770

Type:Conference Paper

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/09F2C770.svg?ark=w1%2F20260515%2F09F2C770)](https://nobleid.org/work/w1/20260515/09F2C770)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy