day15 - Computational Complexity Limited to Concepts of P...

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

View Full Document Right Arrow Icon
Click to edit Master subtitle style 10/4/11 Computational Complexity Limited to Concepts of P and NP COT6410 covers much more
Background image of page 1

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

View Full DocumentRight Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 22 P = Polynomial Time P is the class of decision problems containing all those that can be solved by a deterministic Turing machine using polynomial time in the size of each instance of the problem. P contain linear programming over real numbers, but not when the solution is constrained to integers. P even contains the problem of determining if a number is prime.
Background image of page 2
10/4/11 Dec 2, © UCF (Charles E. 33 NP = Non-Det. Poly Time NP is the class of decision problems solvable in polynomial time on a non-deterministic Turing machine. Clearly P ¨ NP. Whether or not this is proper inclusion is the well-known challenge P = NP? NP can also be described as the class of decision problems that can be verified in polynomial time. NP can even be described as the class of decision
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 7

day15 - Computational Complexity Limited to Concepts of P...

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

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