strong NP-completeness (Q7624684)
property of computational problems that is a special case of NP-completeness
Language:
other details
description property of computational problems that is a special case of NP-completeness

External Links