Search results
Results From The WOW.Com Content Network
This article is a list of notable unsolved problems in computer science. A problem in computer science is considered unsolved when no solution is known or when experts in the field disagree about proposed solutions.
List of unsolved problems may refer to several notable conjectures or open problems in various academic fields: Natural sciences, engineering and medicine [ edit ]
Download as PDF; Printable version; In other projects Wikidata item; Appearance. move to sidebar hide. Help ... List of unsolved problems in computer science; 0–9 ...
As it is suspected, but unproven, that P≠NP, it is unlikely that any polynomial-time algorithms for NP-hard problems exist. [3] [4] A simple example of an NP-hard problem is the subset sum problem. Informally, if H is NP-hard, then it is at least as difficult to solve as the problems in NP.
Instead, computer scientists rely on reductions to formally relate the hardness of a new or complicated problem to a computational hardness assumption about a problem that is better-understood. Computational hardness assumptions are of particular importance in cryptography .
Project Euler (named after Leonhard Euler) is a website dedicated to a series of computational problems intended to be solved with computer programs. [1] [2] The project attracts graduates and students interested in mathematics and computer programming.
Quadratic programming (NP-hard in some cases, P if convex) Subset sum problem [3]: SP13 Variations on the Traveling salesman problem. The problem for graphs is NP-complete if the edge lengths are assumed integers. The problem for points on the plane is NP-complete with the discretized Euclidean metric and rectilinear metric.
Whether these problems are not decidable in polynomial time is one of the greatest open questions in computer science (see P versus NP ("P = NP") problem for an in-depth discussion). An important notion in this context is the set of NP-complete decision problems, which is a subset of NP and might be informally described as the "hardest ...