Complexity Theory 1-24
20 entries in the Complexity Theory compendium.
NP (complexity)Class of decision problems verifiable in polynomial time.NP-hardnessProblems at least as hard as the hardest in NP.P (complexity)Complexity class of polynomial-time solvable decision problems.Nondeterministic Turing machineA computation model with multiple possible actions per state.Time complexityA measure of algorithm running time as input size grows.Space complexityMemory required by an algorithm as a function of input size.Time hierarchy theoremTime hierarchy theorems show more time yields more solvable problems.P versus NP problemA major unsolved problem in theoretical computer science.Theory of computationStudy of computability, complexity, and models of computation.Theoretical computer scienceStudy of abstract and mathematical foundations of computation.Pushdown automatonAn automaton with a stack for recognizing context-free languages.Sorting algorithmAlgorithm that reorders list elements into a specified order.QuicksortEfficient divide-and-conquer sorting algorithm developed by Tony Hoare.Search algorithmAlgorithms designed to solve search problems in data structures.String-searching algorithmAlgorithms that find pattern matches within a body of text.Prim's algorithmGreedy algorithm for minimum spanning trees.Push–relabel maximum flow algorithmEfficient maximum flow algorithm using push and relabel operations.Simplex algorithmAlgorithm for linear programming, derived from simplicial cones.Shortest path problemProblem of minimizing total edge weight between two graph vertices.Travelling salesman problemA classic NP-hard problem in combinatorial optimization.
Browse Complexity Theory 1-24 in the interactive codex →