Delete comment from: Ken Shirriff's blog

Emerald Seaside said...

Ken,
A few minutes with Google will tell you that place and route is NP Complete for many restricted cases and NP Hard for unrestricted cases. But honestly, being able to verify a layout is optimal isn't the problem. The problem is finding an optimal layout in the first place.

Feb 8, 2024, 6:36:53 PM

Posted to Reverse engineering standard cell logic in the Intel 386 processor