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.
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.
Questions on graph coloring, an assignment of colors to elements of a graph subject to specific constraints.
Questions about algorithms related to subsequences, or about properties of subsequences.
For questions about method for storing and manipulating numbers on computer systems, such as floating point or binary representations.
the study of relations (i.e., database tables) and relational operators (join, selection, projection, etc.) as a kind of algebraic structure.
Questions related to mathematical analysis (often called analysis by mathematicians)
Questions about matters of computer, software and communication security, that is how to protect systems against attacks.
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…
Questions regarding solver programs for the boolean satisfiability problem.
For questions about the [assignment problem](https://en.wikipedia.org/wiki/Assignment_problem) in combinatorial optimization, **not** for problems that you've been set as a homework assignment.
LTL (linear temporal logic or linear-time temporal logic) is a temporal logic that can encode assertions about the future of traces.
Requests for books covering a subject. Questions need to admit objective answers and identify a clear set of requirements or criteria for evaluating answers.
a Last In First Out (LIFO) data structure. A common use of stacks is to store subroutine arguments and return addresses.
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…
Questions about how to optimise a program's performance, both manually and automatically, e.g. in compilers.
a subset of the vertices of a graph such that every pair of vertices in the subset is connected by an edge.
Questions related to general, high level, techniques for the design of algorithms.
Questions about the principles of the object-oriented programming paradigm.
Scientific analysis of board games, playing strategies and their complexity
off-topic here. Do not ask questions about how to write code in Java. However, conceptual questions about computer science are more appropriate. See our help center for the s…
Questions about Hoare's logical framework for program correctness proofs and variants.
Applications that allow to create formal proofs. They assist the user by finding partial and checking complete proofs.
Properties that hold before and after every execution of a loop. Used to prove correctness of algorithms.