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.
semi-decidable, also known as recognizable or recursively enumerable.
whenever your question is related to minimum spanning tree (MST). An MST of a connected edge-weighted graph G is a spanning tree whose sum of edge weights is as small as possible. We usua…
a formal logical system used in mathematics, philosophy, linguistics, and computer science.
The study of data representations that enable error detection, error correction and/or compression.
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.
arrangements of the numbers $1,\ldots,n$ in an arbitrary order.
Natural language processing (NLP)
Questions about (typically randomized) algorithms that can produce no or an incorrect answer with a certain probability.
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.
Semantics formally describe the meaning of some syntax.
whenever you have a question about what some particular symbol/notation means.
Questions about simulating one model in another. This includes simulating reality in any model, or simulating a machine model with Turing machines.
Questions on the Master theorem, a method for obtaining asymptotic bounds on recurrences of a specific form.
usually used to refer to counting objects in certain arrangements or with certain properties.
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…
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…
Questions about mathematical induction and inductive proofs.
Questions about how operating systems decide which process to execute at which time.
Sorting algorithm based on recursive partitioning devised by Hoare (ACM Algorithm 63) with fast average case running time.
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.
Using a computer to implement mathematics. For questions about (mathematical) optimization, (also) use the optimization tag.
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…
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…
a particular kind of mathematically-based technique for the specification, development and verification of software and hardware systems.
Questions related to algorithms that use numerical approximations for the problems of mathematical analysis.