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 normal forms in various contexts, for example normal forms of context-free grammars (Chomsky normal form, Greibach normal form), of formulas (conjunctive normal form, disjunctive norma…
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…
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 about memory-management techniques where the computer manages and transfers data between main memory and secondary storage in pages -- discrete chunks of a fixed size. Operating systems oft…
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.
Questions about algorithms related to subsequences, or about properties of subsequences.
Questions regarding solver programs for the boolean satisfiability problem.
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.
For questions about method for storing and manipulating numbers on computer systems, such as floating point or binary representations.
a subset of the vertices of a graph such that every pair of vertices in the subset is connected by an edge.
a Last In First Out (LIFO) data structure. A common use of stacks is to store subroutine arguments and return addresses.
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 how to optimise a program's performance, both manually and automatically, e.g. in compilers.
Questions related to general, high level, techniques for the design of algorithms.
Properties that hold before and after every execution of a loop. Used to prove correctness of algorithms.
Questions about Hoare's logical framework for program correctness proofs and variants.
Questions about the principles of the object-oriented programming paradigm.
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…
For questions about the usage and manipulation of Directed Acyclic Graphs (DAG).
Scientific analysis of board games, playing strategies and their complexity
LTL (linear temporal logic or linear-time temporal logic) is a temporal logic that can encode assertions about the future of traces.