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.
193 questions
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…
187 questions
a formal logical system used in mathematics, philosophy, linguistics, and computer science.
186 questions
The study of data representations that enable error detection, error correction and/or compression.
183 questions
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.
181 questions
arrangements of the numbers $1,\ldots,n$ in an arbitrary order.
180 questions
Natural language processing (NLP)
176 questions
Questions about (typically randomized) algorithms that can produce no or an incorrect answer with a certain probability.
170 questions
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.
170 questions
Semantics formally describe the meaning of some syntax.
169 questions
whenever you have a question about what some particular symbol/notation means.
167 questions
Questions about simulating one model in another. This includes simulating reality in any model, or simulating a machine model with Turing machines.
165 questions
Questions on the Master theorem, a method for obtaining asymptotic bounds on recurrences of a specific form.
161 questions
usually used to refer to counting objects in certain arrangements or with certain properties.
156 questions
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…
149 questions
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.
141 questions
Questions about how operating systems decide which process to execute at which time.
137 questions
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.
135 questions
Using a computer to implement mathematics. For questions about (mathematical) optimization, (also) use the optimization tag.
133 questions
Questions about properties of, working with and algorithms on integers.
132 questions
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…
131 questions
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…
130 questions
a particular kind of mathematically-based technique for the specification, development and verification of software and hardware systems.
130 questions
Questions related to algorithms that use numerical approximations for the problems of mathematical analysis.
130 questions
129 questions
1 2 3