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.

Hardness of approximation, aka inapproximability.
181 questions
Questions in Information Theory
179 questions
A reduction is the transformation of one problem into another problem. A example of using a reduction would be to be to show if a problem P is undecidable. This would be achieved by transforming or pe…
179 questions
Questions whose answers are a big list of items (books, theorems, software, ...)
166 questions
Randomness is a key component of probabilistic algorithms, many combinatorial aarguments, the analysis of hashing functions, and in cryptography, among other applications.
155 questions
137 questions
Two graphs G, H are isomorphic if there is a relabeling of the vertices of G that produces H, and vice-versa. The graph isomorphism problem (GI) is to decide whether two given are isomorphic. In addit…
131 questions
Questions regarding the amount of communication needed to accomplish a computational task, when the information about the task is spread across several agents
121 questions
Questions about the formal languages that can be described by regular expressions (in the sense of Kleene), or, equivalently, the languages that can be accepted by finite automata.
120 questions
Theoretical issues related to the quantum treatment of information
119 questions
NP stands for Nondeterministic Polynomial time.
114 questions
An overlapping feature of type theory and type systems.
113 questions
Given a sequence of elements, find a permutation such that the elements are in a certain order.
111 questions
The mathematical theory of codes, as used in communication, data compression, and cryptography.
110 questions
Theoretical questions in Distributed Computing
106 questions
Questions in category theory
105 questions
A tree is a special type of graph which only allows for a hierarchical set of edges similar to a tree . Mathematically it is actually an arborescence. Trees have a root node and children nodes. In for…
102 questions
Theoretical question related to Computer Science and Game Theory
99 questions
Theoretical questions in Parallel Computing
99 questions
Every randomized algorithm can be simulated by a deterministic algorithm, at the expense of an exponential increase in running time. Derandomization is about converting randomized algorithms into …
98 questions
The study of the computational complexity of problems with respect to more than one parameter.
97 questions
Questions in number theory
97 questions
95 questions
questions about definitions, terms, and common names in theoretical computer science.
93 questions
This is a mathematical structure composed of a set of points or vertices and a set of connectors or edges. The edges connect the vertices and those vertices are directed. Also no cycles or in other wo…
91 questions
Questions regarding oracle machines in computational complexity theory. Oracles can serve as an indicator that a separation between complexity classes is beyond the scope of certain proof techniqu…
90 questions
The Kolmogorov complexity of a string s is equal to the length of the shortest program computing s and halting. Measures the lack of structure in a string.
87 questions
3 4 5