Mystery
•
Secrecy
•
Unsolved problems
•
Computer science
•
War
•
Open problem
Mathematical problem
Unsolved problems in mathematics
Conjecture
Unsolved problems in computer science
Lists of unsolved problems
List of unsolved problems in mathematics
List of unsolved problems in computer science
This article is a list of unsolved problems in computer science. A problem in computer science is considered unsolved when an expert in the field (i.e, a computer scientist) considers it unsolved or w...
List of unsolved problems in computer science - Wikipedia
List of unsolved problems in computer science - Wikipedia
POPLmark challenge - Slideshow
POPLmark challenge
In programming language theory, the POPLmark challenge (formerly Mechanized Metatheory for the Masses!) is a set of benchmarks designed to evaluate the state of mechanization in the metatheory of prog...
Unique games conjecture
In computational complexity theory, the Unique Games Conjecture is a conjecture made by Subhash Khot in 2002. The conjecture postulates that the problem of determining the approximate value of a certa...
P versus NP problem
The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by ...
P versus NP problem - Wikipedia
One-way function
In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here, "easy" and "hard" are to be understood in the...
Complexity class
In computational complexity theory, a complexity class is a set of problems of related resource-based complexity. A typical complexity class has a definition of the form:For example, the class NP is t...
NP-complete
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. The set of NP-complete problems is often denoted by NP-C or NPC. The abbreviation NP refers to ...
Computational complexity of mathematical operations
The following tables list the running time of various algorithms for common mathematical operations.Here, complexity refers to the time complexity of performing computations on a multitape Turing mach...
Aanderaa-Karp-Rosenberg conjecture
In theoretical computer science, the Aanderaa–Karp–Rosenberg conjecture (also known as the Aanderaa–Rosenberg conjecture or the evasiveness conjecture) is a group of related conjectures about the numb...