<Table> <Tr> <Td> </Td> <Td> This article may be confusing or unclear to readers . Please help us clarify the article . There might be a discussion about this on the talk page . (July 2012) (Learn how and when to remove this template message) </Td> </Tr> </Table> <Tr> <Td> </Td> <Td> This article may be confusing or unclear to readers . Please help us clarify the article . There might be a discussion about this on the talk page . (July 2012) (Learn how and when to remove this template message) </Td> </Tr> <P> In computational complexity theory, an NP - complete decision problem is one belonging to both the NP and the NP - hard complexity classes . In this context, NP stands for "nondeterministic polynomial time". The set of NP - complete problems is often denoted by NP - C or NPC . </P>

Np hard and np complete problem in daa