Search results
Results From The WOW.Com Content Network
Download as PDF; Printable version; In other projects ... This article is a list of notable unsolved problems in computer science. A problem in computer science is ...
Pages in category "Unsolved problems in computer science" The following 33 pages are in this category, out of 33 total. This list may not reflect recent changes .
List of unsolved problems may refer to several notable conjectures or open problems in various academic fields: Natural sciences, engineering and medicine [ edit ]
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 .
The Parsons problem format is used in the learning and teaching of computer programming. Dale Parsons and Patricia Haden of Otago Polytechnic developed Parsons's Programming Puzzles to aid the mastery of basic syntactic and logical constructs of computer programming languages, in particular Turbo Pascal, [1] although any programming language ...
In computer science, the ostrich algorithm is a strategy of ignoring potential problems on the basis that they may be exceedingly rare. It is named after the ostrich effect which is defined as "to stick one's head in the sand and pretend there is no problem". It is used when it appears the situation may be more cost-effectively managed by ...
Informally, an NP-complete problem is an NP problem that is at least as "tough" as any other problem in NP. NP-hard problems are those at least as hard as NP problems; i.e., all NP problems can be reduced (in polynomial time) to them. NP-hard problems need not be in NP; i.e., they need not have solutions verifiable in polynomial time.
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 ...