The field of computational complexity theory attempts to determine the amount of resources (computational complexity) solving a given problem will require...

theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and...

Computational thinking (CT) refers to the thought processes involved in formulating problems so their solutions can be represented as computational steps...

In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the...

purchaser problem and the vehicle routing problem are both generalizations of TSP. In the theory of computational complexity, the decision version of the...

decision problems, the problem is more naturally characterized as an optimization problem. Counting problem (complexity) – Type of computational problem Design...

geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry...

Hypercomputation Computational problem Limits of computation Computationalism The study of non-computable statements is the field of hypercomputation. Computation from...

time. The problem has been called the most important open problem in computer science. Aside from being an important problem in computational theory, a...

programming portal Bin packing problem – Mathematical and computational problem Change-making problem – the computational problem of choosing as few coins as...

In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete...

Computational physics is the study and implementation of numerical analysis to solve problems in physics. Historically, computational physics was the...

In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time...

The Dutch national flag problem is a computational problem proposed by Edsger Dijkstra. The flag of the Netherlands consists of three colors: red, white...

In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete. In his 1972 paper, "Reducibility...

In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly...

computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation...

computational complexity theory, a computational resource is a resource used by some computational models in the solution of computational problems....

In computability theory, an undecidable problem is a type of computational problem that requires a yes/no answer, but where there cannot possibly be any...

mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently...

known for computational solutions.[citation needed] Problem domains for computational science/scientific computing include: Predictive computational science...

routing Reach-based pruning Labeling Hub labels For shortest path problems in computational geometry, see Euclidean shortest path. The shortest multiple disconnected...

(2021). "The prospects of quantum computing in computational molecular biology". WIREs Computational Molecular Science. 11. arXiv:2005.12792. doi:10...

NP-complete problem in computational complexity theory. Furthermore, the vertex cover problem is fixed-parameter tractable and a central problem in parameterized...

The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. The problem is not known to be solvable...

refers to the use of distributed systems to solve computational problems. In distributed computing, a problem is divided into many tasks, each of which is...

In computational complexity theory and quantum computing, Simon's problem is a computational problem that is proven to be solved exponentially faster...

In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where...

game theory, machine learning, computational biology, computational economics, computational geometry, and computational number theory and algebra. Work...

In philosophy of mind, the computational theory of mind (CTM), also known as computationalism, is a family of views that hold that the human mind is an...