Skip to main content
Share Your Experience: Take the 2024 Developer Survey


A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.

Questions about algorithms related to substrings, or about properties of substrings.
150 questions
Used in questions asking for efficient (polynomial-time) reductions between computational problems.
150 questions
A class of computational problems. Where decision problems call for a yes-or-no answer, search problems are looking for an object satisfying a certain property.
149 questions
Questions related to algorithms that use numerical approximations for the problems of mathematical analysis.
149 questions
Divide-and-conquer is an algorithmic technique in which a problem is divided into smaller subproblems, whose solutions are combined to a solution of the original problem. Classical examples include me…
149 questions
Questions about the binary search algorithm, which can be used to find elements of an ordered list in O(log n) time.
A method in analysis of algorithms that considers the overall cost of a sequence of operations.
147 questions
Questions about genesis and development of computer science as a scientific discipline and its applications.
146 questions
Questions on graph coloring, an assignment of colors to elements of a graph subject to specific constraints.
145 questions
The spanning tree of a connected undirected graph G is a tree having all the vertices and some number of edges of G.
145 questions
Clustering is the problem of finding groups of data points (often modelled as nodes in a graph) that are closer to each other than to other points.
145 questions
Theory of dynamic processes with several competing actors that try to achieve some goal in a strategic way.
144 questions
Using the techniques of artificial intelligence and machine learning to extract patterns from large data sets and transforming those data into a useful, organized form for future processing.
142 questions
General questions regarding learning computer science disciplines and CS education
141 questions
Questions on genetic algorithms, a family of evolutionary search heuristics. Genetic Algorithms are adaptive heuristic search algorithms based on the evolutionary ideas of natural selection and generi…
140 questions
140 questions
Questions about algorithms that deterministically generate sequences of numbers that have stochastic properties of random sequences.
136 questions
Set cover is a well-known NP-complete problem: given a collection of sets, find as small as possible a subcollection whose union is the same as the union of the entire collection.
132 questions
Questions about the relation of (subfields of) computer science to the relevant mathematical foundations and their application.
132 questions
131 questions
Category theory is used to formalize mathematics and its concepts as a collection of objects and arrows (also called morphisms). Category theory can be used to formalize concepts of other high-level a…
126 questions
Questions about methods and techniques to prove correctness of programs.
126 questions
Error correcting codes are used to transmit information through a noisy channel. They also have applications in theoretical computer science and combinatorics. Some well known error correcting codes a…
125 questions
Questions about techniques for enforcing an agreed order of events between several concurrently executing threads. Specific synchronization mechanisms include mutexes (locks), condition variables, se…
124 questions
A clique is a subset of the vertices of a graph such that every pair of vertices in the subset is connected by an edge.
122 questions
Questions about the NP-complete problem Subset Sum.
121 questions
Questions related to mathematical analysis (often called analysis by mathematicians)
120 questions
An overlapping feature of type theory and type systems.
119 questions
119 questions
3 4
6 7