A 3SAT instance reduced to clique via polynomial reduction may require checking exponentially many cliques despite polynomial-bounded reduction overhead.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.