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 algorithmic strategies that quickly solve a problem well most of the time, but give no guarantees.
223 questions
First-order logic is a formal logical system used in mathematics, philosophy, linguistics, and computer science.
218 questions
Questions about which problems are semi-decidable, also known as computably enumerable, Turing recognizable or recursively enumerable.
213 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.
206 questions
The study of data representations that enable error detection, error correction and/or compression.
200 questions
Permutations are arrangements of the numbers $1,\ldots,n$ in an arbitrary order.
197 questions
Questions about (typically randomized) algorithms that can produce no or an incorrect answer with a certain probability.
194 questions
whenever you have a question about what some particular symbol/notation means.
185 questions
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…
184 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.
184 questions
Natural language processing (NLP)
183 questions
Questions on the Master theorem, a method for obtaining asymptotic bounds on recurrences of a specific form.
179 questions
The term Counting in Computer Science is usually used to refer to counting objects in certain arrangements or with certain properties.
178 questions
Questions about simulating one model in another. This includes simulating reality in any model, or simulating a machine model with Turing machines.
174 questions
Semantics formally describe the meaning of some syntax.
174 questions
3SAT is a famous special case of the boolean satisfiability problem (SAT).
165 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…
164 questions
A partition or partitioning of a set A is a collection of disjoint sets whose union yields A.
157 questions
Questions about mathematical induction and inductive proofs.
157 questions
Sorting algorithm based on recursive partitioning devised by Hoare (ACM Algorithm 63) with fast average case running time.
154 questions
Using a computer to implement mathematics. For questions about (mathematical) optimization, (also) use the optimization tag.
151 questions
Questions about properties of, working with and algorithms on integers.
150 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…
149 questions
145 questions
Questions about how operating systems decide which process to execute at which time.
145 questions
Questions related to algorithms that use numerical approximations for the problems of mathematical analysis.
144 questions
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.
141 questions
a particular kind of mathematically-based technique for the specification, development and verification of software and hardware systems.
140 questions
1 2 3