Although Subgraph Isomorphism problem is known to be NP-complete,our solution is very fast in practice for real circuits.

• 尽管子图同构问题是NP完全问题,算法对实际的电路是快速的,满足工程需要。