(Q215206)

Statements

instance of

complexity class

0 references

subclass of

computational problem

0 references

part of

NP-hardness

0 references

NP

0 references

facet of

P versus NP problem

0 references

image

P np np-complete np-hard.svg
800 × 500; 13 KB

0 references

has characteristic

completeness

of

NP

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

Stack Exchange tag

https://cstheory.stackexchange.com/tags/np-complete

0 references

https://cs.stackexchange.com/tags/np-complete

0 references

https://stackoverflow.com/tags/np-complete

0 references

has part(s)

weak NP-completeness

0 references

strong NP-completeness

0 references

topic's main category

Category:NP-complete problems

1 reference

imported from Wikimedia project

Serbian Wikipedia

Identifiers