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.
Approximate representation of numbers as a fixed number of digits multiplied by a logarithmic scale.
First-order logic is a formal logical system used in mathematics, philosophy, linguistics, and computer science.
A matching (aka **Independent Edge Set**) in a simple graph is the set of pairwise non-adjacent edges i.e. no two edges have common vertex.
Questions about which problems are semi-decidable, also known as computably enumerable, Turing recognizable or recursively enumerable.
Permutations are arrangements of the numbers $1,\ldots,n$ in an arbitrary order.
Questions about (typically randomized) algorithms that can produce no or an incorrect answer with a certain probability.
The study of data representations that enable error detection, error correction and/or compression.
whenever you have a question about what some particular symbol/notation means.
Programming questions are off-topic here. Do not ask questions about how to write code in Python. However, conceptual questions about computer science are more appropriate. See our help center for the…
The term Counting in Computer Science is usually used to refer to counting objects in certain arrangements or with certain properties.
loops with relevance to computer programming are a sequence of instructions that is continually repeated until a certain condition is reached or a condition wasn't met.
Natural language processing (NLP)
Questions on the Master theorem, a method for obtaining asymptotic bounds on recurrences of a specific form.
Questions about simulating one model in another. This includes simulating reality in any model, or simulating a machine model with Turing machines.
Semantics formally describe the meaning of some syntax.
3SAT is a famous special case of the boolean satisfiability problem (SAT).
Questions about mathematical induction and inductive proofs.
covers algorithms that enumerate some set, whether finite or infinite. Do not use it for questions about computability classes, such as recursively enumerable (RE) sets; use tags [computabili…
A partition or partitioning of a set A is a collection of disjoint sets whose union yields A.
Questions about properties of, working with and algorithms on integers.
Questions about techniques for providing the appearance of an isolated, contiguous address space to each process. The size of the address spaces may be made to appear larger than the size of main mem…
Sorting algorithm based on recursive partitioning devised by Hoare (ACM Algorithm 63) with fast average case running time.
Using a computer to implement mathematics. For questions about (mathematical) optimization, (also) use the optimization tag.
Questions related to algorithms that use numerical approximations for the problems of mathematical analysis.
a particular kind of mathematically-based technique for the specification, development and verification of software and hardware systems.
Questions about how operating systems decide which process to execute at which time.