search

cjdrake / pyeda

Python EDA
BSD 2-Clause "Simplified" License
301 stars 55 forks source link

Possible NP-hard vs NP-complete confusion in the docs #163

Open stephane-2 opened 3 years ago

stephane-2 commented 3 years ago

"Logic minimization is known to be an NP-complete problem"

Is it really?