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.
In computability and complexity, finding mappings between problems that allow solving one problem using a solution of another one. For reduction in programming language theory (e.g. beta-reduction), s…
Reserved -- shouldn't be used for most new questions. Questions with a broad scope about general methods and concepts, such as proof methods, tools for algorithm analysis or basics of computer archit…
Questions requesting papers in the literature on specific, narrow issues.
Questions about regular expressions, a formalism to describe regular languages.
Questions about properties of the class of regular languages and individual languages.
the study of relations (i.e., database tables) and relational operators (join, selection, projection, etc.) as a kind of algebraic structure.
Rice's Theorem states that any (non-trivial) property of Turing machines is undecidable.
Questions about methods for estimating the increase in runtime of an algorithm as the input size increases.
Creating samples from a well-specified population using a probabilistic method and/or producing random numbers from a specified distribution.
the problem of determining whether there is a variable assignment that fulfills a given Boolean formula.
Questions regarding solver programs for the boolean satisfiability problem.
Questions about the optimisation problem of ordering a set of tasks so that some objective function (e.g. makespan) is minimised. The set of constraints is crucial; in particular, there is a large bod…
Algorithms for finding an element in some specified data-structure (most commonly, in a tree).
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.
Questions about search trees, a class of data structures used for storing sorted data for efficient access.