[{"n": "NP (complexity)", "u": "/e/complexity-theory/np-complexity/", "s": "Class of decision problems verifiable in polynomial time."}, {"n": "NP-hardness", "u": "/e/complexity-theory/np-hardness/", "s": "Problems at least as hard as the hardest in NP."}, {"n": "P (complexity)", "u": "/e/complexity-theory/p-complexity/", "s": "Complexity class of polynomial-time solvable decision problems."}, {"n": "Nondeterministic Turing machine", "u": "/e/complexity-theory/nondeterministic-turing-machine/", "s": "A computation model with multiple possible actions per state."}, {"n": "Time complexity", "u": "/e/complexity-theory/time-complexity/", "s": "A measure of algorithm running time as input size grows."}, {"n": "Space complexity", "u": "/e/complexity-theory/space-complexity/", "s": "Memory required by an algorithm as a function of input size."}, {"n": "Time hierarchy theorem", "u": "/e/complexity-theory/time-hierarchy-theorem/", "s": "Time hierarchy theorems show more time yields more solvable problems."}, {"n": "P versus NP problem", "u": "/e/complexity-theory/p-versus-np-problem/", "s": "A major unsolved problem in theoretical computer science."}, {"n": "Theory of computation", "u": "/e/complexity-theory/theory-of-computation/", "s": "Study of computability, complexity, and models of computation."}, {"n": "Theoretical computer science", "u": "/e/complexity-theory/theoretical-computer-science/", "s": "Study of abstract and mathematical foundations of computation."}, {"n": "Pushdown automaton", "u": "/e/complexity-theory/pushdown-automaton/", "s": "An automaton with a stack for recognizing context-free languages."}, {"n": "Sorting algorithm", "u": "/e/complexity-theory/sorting-algorithm/", "s": "Algorithm that reorders list elements into a specified order."}, {"n": "Quicksort", "u": "/e/complexity-theory/quicksort/", "s": "Efficient divide-and-conquer sorting algorithm developed by Tony Hoare."}, {"n": "Search algorithm", "u": "/e/complexity-theory/search-algorithm/", "s": "Algorithms designed to solve search problems in data structures."}, {"n": "String-searching algorithm", "u": "/e/complexity-theory/string-searching-algorithm/", "s": "Algorithms that find pattern matches within a body of text."}, {"n": "Prim's algorithm", "u": "/e/complexity-theory/prim-s-algorithm/", "s": "Greedy algorithm for minimum spanning trees."}, {"n": "Push–relabel maximum flow algorithm", "u": "/e/complexity-theory/push-relabel-maximum-flow-algorithm/", "s": "Efficient maximum flow algorithm using push and relabel operations."}, {"n": "Simplex algorithm", "u": "/e/complexity-theory/simplex-algorithm/", "s": "Algorithm for linear programming, derived from simplicial cones."}, {"n": "Shortest path problem", "u": "/e/complexity-theory/shortest-path-problem/", "s": "Problem of minimizing total edge weight between two graph vertices."}, {"n": "Travelling salesman problem", "u": "/e/complexity-theory/travelling-salesman-problem/", "s": "A classic NP-hard problem in combinatorial optimization."}]