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.

× 151
a formal logical system used in mathematics, philosophy, linguistics, and computer science.
× 151
The Traveling Salesman Problem and variants
× 150
Semantics formally describe the meaning of some syntax.
× 141
The study of data representations that enable error detection, error correction and/or compression.
× 140
Questions about simulating one model in another. This includes simulating reality in any model, or simulating a machine model with Turing machines.
× 138
whenever you have a question about what some particular symbol/notation means.
× 136
Questions about (typically randomized) algorithms that can produce no or an incorrect answer with a certain probability.
× 131
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.
× 130
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…
× 126
usually used to refer counting objects in certain arrangements or with certain properties.
× 122
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.
× 116
a particular kind of mathematically-based technique for the specification, development and verification of software and hardware systems.
× 116
General questions regarding learning computer science disciplines and CS education
× 112
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 [tag:computa…
× 111
Questions about properties of, working with and algorithms on integers.
× 110
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…
× 109
Questions about how operating systems decide which process to execute at which time.
× 109
Questions about mathematical induction and inductive proofs.
× 105
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…
× 105
Questions about genesis and development of computer science as a scientific discipline and its applications.
× 105
The spanning tree of a connected undirected graph G is a tree having all the vertices and some number of edges of G.
× 104
Questions on the Master theorem, a method for obtaining asymptotic bounds on recurrences of a specific form.
× 103
Questions related to algorithms that use numerical approximations for the problems of mathematical analysis.