Reference no: EM133360966
Assignment:
Asked by ProfStraw536
L?et A(G,k) be a polynomial-time algorithm that, for arbitrary graph G and natural number k, with probability at least 1/2, returns 1 if G has a clique of size k and, with probability 1, returns 0 if G has no such a clique.
L?et B(G,k) be a polynomial-time algorithm that, for arbitrary graph G and natural number k, with probability at least 1/2, returns 1 if G has an independent set of size kk and, with probability 1, returns 0 if G has no such an independent set.
D?escribe a polynomial-time algorithm C(G,,k,m) that, for arbitrary graph G and natural numbers k and m, with probability at least 1/2, returns 1 if G has a clique of size k and an independent set of size m and, with probability 1, returns 0 otherwise.