18 relations: Cartesian product, Communications of the ACM, Comparison sort, Computer science, Elwyn Berlekamp, Fare, Fast Fourier transform, Integer sorting, List of unsolved problems in computer science, Michael Fredman, Non-constructive algorithm existence proofs, Ordered pair, Random-access machine, Shortest path problem, Sorting algorithm, Time complexity, Word (computer architecture), 3SUM.
In set theory (and, usually, in other parts of mathematics), a Cartesian product is a mathematical operation that returns a set (or product set or simply product) from multiple sets.
Communications of the ACM is the monthly journal of the Association for Computing Machinery (ACM).
A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a "less than or equal to" operator or a three-way comparison) that determines which of two elements should occur first in the final sorted list.
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
Elwyn Ralph Berlekamp (born September 6, 1940) is an American mathematician.
A fare is the fee paid by a passenger for use of a public transport system: rail, bus, taxi, etc.
A fast Fourier transform (FFT) is an algorithm that samples a signal over a period of time (or space) and divides it into its frequency components.
In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by numeric keys, each of which is an integer.
This article is a list of unsolved problems in computer science.
Michael Lawrence Fredman is an emeritus professor at the Computer Science Department at Rutgers University, United States.
The vast majority of positive results about computational problems are constructive proofs, i.e., a computational problem is proved to be solvable by showing an algorithm that solves it; a computational problem is shown to be in P (complexity) by showing an algorithm that solves it in time that is polynomial in the size of the input; etc.
In mathematics, an ordered pair (a, b) is a pair of objects.
In computer science, random-access machine (RAM) is an abstract machine in the general class of register machines.
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order.
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
In computing, a word is the natural unit of data used by a particular processor design.
In computational complexity theory, the 3SUM problem asks if a given set of n real numbers contains three elements that sum to zero.