Fandom

DSZQUP XJLJ

List of unsolved problems in computer science

566pages on
this wiki
Add New Page
Talk0 Share

Template:Expand Template:Cleanup

This article is a list of unsolved problems in computer science. Solutions to the problems in this list would have a major impact on the field of study to which they belong.

P = NP?Edit

Main article: P and NP
Field 
Theory of computation
Source 
S. A. Cook and Leonid Levin, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (1971), pp. 151–158.
Description 
P is the class of problems whose solution can be found in polynomial time. NP is the class of problems whose solution can be found in polynomial time with a non-deterministic algorithm or, equivalently, whose solution (if it exists) can be deterministically verified in polynomial time. Naturally, any problem in P is also in NP. The P versus NP question is whether NP is also a subset of P, and hence whether the classes are equal. One can see the question as a specific case of the problem in proving lower bounds for computational problems.
Importance 
If the classes are equal then we can solve many problems that are currently considered intractable. If they are not, then NP-complete problems are problems that are probably hard. P=NP would imply that one-way functions do not exist (see below).
Conjecture 
Though the question is far from being settled, most experts believe that the classes are different.[1]

The existence of one-way functionsEdit

Main article: One-way function
Field 
Cryptography
Source 
W. Diffie, M. E. Hellman, IEEE Trans. Inform. Theory, IT-22, 6, 1976, pp. 644–654 Online copy (HTML)
Description 
One-way functions are easy to compute but hard to invert. Although there are several candidates for which no good (i.e. quick) reverse algorithms are currently known, it has not yet been proven that any function exists for which no such reverse algorithms exist.
Importance 
If one-way functions do not exist then secure public key cryptography is impossible. Their existence would imply that many complexity classes are not learnable, and that P≠NP. P≠NP does not imply that one-way functions exist, however.
Conjecture 
It is assumed but unproven that they do exist. Several encryption systems are based on the assumption that modular exponentiation is a one-way function.

See also Edit

References Edit

  1. Template:Cite journal

Template:Unsolved problemses:Problemas no resueltos de la informática ko:전산학의 미해결 문제 ja:計算機科学の未解決問題 pt:Problemas em aberto da ciência da computação

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.