When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. List of unsolved problems in computer science - Wikipedia

    en.wikipedia.org/wiki/List_of_unsolved_problems...

    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.

  3. Category:Unsolved problems in computer science - Wikipedia

    en.wikipedia.org/wiki/Category:Unsolved_problems...

    Print/export Download as PDF; Printable version; In other projects Wikidata item; ... Pages in category "Unsolved problems in computer science"

  4. Lists of unsolved problems - Wikipedia

    en.wikipedia.org/wiki/Lists_of_unsolved_problems

    List of unsolved problems may refer to several notable conjectures or open problems in various academic fields: Natural sciences, engineering and medicine [ edit ]

  5. Computational hardness assumption - Wikipedia

    en.wikipedia.org/wiki/Computational_hardness...

    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 .

  6. Project Euler - Wikipedia

    en.wikipedia.org/wiki/Project_Euler

    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.

  7. NP-completeness - Wikipedia

    en.wikipedia.org/wiki/NP-completeness

    The Subgraph Isomorphism problem is NP-complete. The graph isomorphism problem is suspected to be neither in P nor NP-complete, though it is in NP. This is an example of a problem that is thought to be hard, but is not thought to be NP-complete. This class is called NP-Intermediate problems and exists if and only if P≠NP.

  8. P versus NP problem - Wikipedia

    en.wikipedia.org/wiki/P_versus_NP_problem

    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.

  9. NP (complexity) - Wikipedia

    en.wikipedia.org/wiki/NP_(complexity)

    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 ...