Delete comment from: Ken Shirriff's blog
Is place & route as easy as NP-complete? That implies a polynomial-time way to verify that a given layout is optimal.
Feb 6, 2024, 1:56:28 AM
Posted to Reverse engineering standard cell logic in the Intel 386 processor