Search Result for "co-np":
perl: warning: Please check that your locale settings:
	LANGUAGE = (unset),
	LC_ALL = (unset),
	LC_TIME = "tr_TR.UTF-8",
	LC_MONETARY = "tr_TR.UTF-8",
	LC_ADDRESS = "tr_TR.UTF-8",
	LC_TELEPHONE = "tr_TR.UTF-8",
	LC_NAME = "tr_TR.UTF-8",
	LC_MEASUREMENT = "tr_TR.UTF-8",
	LC_IDENTIFICATION = "tr_TR.UTF-8",
	LC_NUMERIC = "tr_TR.UTF-8",
	LC_PAPER = "tr_TR.UTF-8",
	LANG = "C"
    are supported and installed on your system.
perl: warning: Falling back to the standard locale ("C").
1 definitions retrieved:

The Free On-line Dictionary of Computing (18 March 2015):

complementary nondeterministic polynomial Co-NP (Co-NP) The set (or property) of problems with a yes/no answer where the complementary no/yes problem takes nondeterministic polynomial time (NP). For example, "Is n prime" is Co-NP and "Is n not prime" is NP, since it is only necessary to find one factor to prove that n is not prime whereas to prove that it is prime all possible factors must be eliminated. (2009-05-21)