A problem L is co-NP-complete if and only if L is in co-NP and for any problem in co-NP, there exists a polynomial-time reduction from that problem to L.
A problem L is co-NP-complete if and only if L is in co-NP and for any problem in co-NP, there. exists a polynomial-time reduction from that problem to L