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.
161 questions
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…
161 questions
Questions in Information Theory
160 questions
a big list of items (books, theorems, software, ...)
159 questions
a key component of probabilistic algorithms, many combinatorial aarguments, the analysis of hashing functions, and in cryptography, among other applications.
148 questions
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…
126 questions
125 questions
Theoretical issues related to the quantum treatment of information
116 questions
Questions regarding the amount of communication needed to accomplish a computational task, when the information about the task is spread across several agents
116 questions
Given a sequence of elements, find a permutation such that the elements are in a certain order.
106 questions
NP stands for Nondeterministic Polynomial time.
106 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.
104 questions
Theoretical questions in Distributed Computing
102 questions
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…
99 questions
The mathematical theory of codes, as used in communication, data compression, and cryptography.
98 questions
Theoretical questions in Parallel Computing
97 questions
Theoretical question related to Computer Science and Game Theory
94 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 …
93 questions
91 questions
Questions in category theory
91 questions
Questions in number theory
91 questions
questions about definitions, terms, and common names in theoretical computer science.
88 questions
The study of the computational complexity of problems with respect to more than one parameter.
86 questions
Questions about space resources of computations in computational complexity or algorithms.
81 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…
81 questions
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…
79 questions
Questions about or related to P vs. NP
78 questions
3 4 5