Lec19NPC - April 13th Class Notes Hw# 5 will be worth 50...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
April 13 th Class Notes Hw# 5 will be worth 50 points and it will be posted tonight or tomorrow
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Definition of the Class NP 1)Language that can be accepted on a nondeterministic TM in polynomial time. If it isn’t in the language it may not reject in polynomial time 2)Given a certificate, one can verify in polynomial time whether or not an input is in the language
Background image of page 2
Hampath={<G>|G has a Hamiltonian path} This doesn’t have a Hampath since there are three vertices of degree one and we would need a way in and a way out
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
The graph below has a hampath
Background image of page 4
One Hampath for the diagram is A-B-D-F-E-C This path can be used to represent a certificate. Verifying this path would take less than polynomial time We can also prove that this can NP by checking all path options at once
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Hampath={<G>|Gdoesn’t have a hamiltonion path There is not an easy certificate that can be generated to prove that no path exists This is Co-NP (compliment NP)
Background image of page 6
Composites ={n|n exists Z+ and there exists a p and q such that n=p*q} Can easily produce a certificate ie if n=143 p=11 and q=13
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Primes={n|there is no way to represent n=p*q, where pa nd q exist in Z+ and P>1 and q>1} This has been shown to be O(n**6) by AKS
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/16/2011 for the course COT 4210 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Page1 / 16

Lec19NPC - April 13th Class Notes Hw# 5 will be worth 50...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online