View the step-by-step solution to:

# a) (15pts) Describe an NTM M = (Q, 2, 6, qo, F) that computes CLIQUE in 0(n2) time. Define the ,5 components without ambiguity.

Work these out to best of your ability. Please explain steps so I can understand

a) (15pts) Describe an NTM M = (Q, 2, 6, qo, F) that computes CLIQUE
in 0(n2) time. Define the ,5 components without ambiguity.

b) (20pts) Prove that the following problem is NP-complete.
HAM-CYCLE
Input: graph GﬂV, E)
Output: True if and only if there is a simple cycle
including every node in V.
In addition to the reduction, explain your basic method in 5-15 lines.

### Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

### -

Educational Resources
• ### -

Study Documents

Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

Browse Documents