Item Icon
\"Reading Printer Friendly Page Tell A Friend
No ratings.
Rated: E · Thesis · Scientific · #1740238

Computational problem

Assertion: P=NP

Expected result: P≠NP

Proof construct:

P= The complexity class of decision problems that can be solved on a deterministic Turing machine in polynomial time.

NP= The complexity class of decision problems that can be solved on a non-deterministic Turing machine in polynomial time.

All problems in NP have polynomial-time algorithms.

© Copyright 2011 Apriori (lostlocal at Writing.Com). All rights reserved.
Writing.Com, its affiliates and syndicates have been granted non-exclusive rights to display this work.