P versus NP and the Irreducibility of NP-Complete Problems to P-Complete Problems

39 Views Asked by At

If it can be shown that a given NP-complete problem such as Clique cannot be reduced to a given P-complete problem, such as Horn-SAT, then we can conclude that P does not equal NP?