complementary of NP problemIn co-NP problem, no-instances have concise Complexity Certificate co-NPIn computational complexity theory, co-NP is a complexity class. A decision problem X is a member of co-NP if and only if its complement X is in the complexity class NP. The class can be defined as follows: a decision problem is in co-NP if and only if for every no-instance we have a polynomial-length "certificate" and there is a polynomial-time algorithm that can be used to verify any purported certificate.https://en.wikipedia.org/wiki/Co-NP(PDF) Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problemsPDF | Scheduling problems have many real life applications, from automotive industry to air traffic control. These problems are defined by the need of... | Find, read and cite all the research you need on ResearchGatehttps://www.researchgate.net/publication/277054640_Optimised_search_heuristics_combining_metaheuristics_and_exact_methods_to_solve_scheduling_problems?_tp=eyJjb250ZXh0Ijp7ImZpcnN0UGFnZSI6Il9kaXJlY3QiLCJwYWdlIjoiX2RpcmVjdCJ9fQ
