pyeda
pyeda copied to clipboard
Possible NP-hard vs NP-complete confusion in the docs
"Logic minimization is known to be an NP-complete problem"
Is it really?