complexity theory - Reconciling Quine-McCluskey Algorithm -


i'm looking @ article on wikipdia algorithm, , see 2 seemingly contradictory statements:

"it gives deterministic way check minimal form of boolean function has been reached"

and

"has limited range of use since problem solves np-hard"

thoughts?

p.s. there visual studio plugin can reduce conditional logic applying algorithtm highlighted code?

the algorithm takes exponential time. np-complete problems can solved in exponential time. presumably problem referred np-complete in addition being np-hard.

the discrepancy because don't understand definition of np-hard: http://en.wikipedia.org/wiki/np-hard


Comments

Popular posts from this blog

java - SNMP4J General Variable Binding Error -

windows - Python Service Installation - "Could not find PythonClass entry" -

Determine if a XmlNode is empty or null in C#? -