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.
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…
a key component of probabilistic algorithms, many combinatorial aarguments, the analysis of hashing functions, and in cryptography, among other applications.
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…
Theoretical issues related to the quantum treatment of information
Questions regarding the amount of communication needed to accomplish a computational task, when the information about the task is spread across several agents
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.
Given a sequence of elements, find a permutation such that the elements are in a certain order.
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…
Theoretical question related to Computer Science and Game Theory
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 …
questions about definitions, terms, and common names in theoretical computer science.
The mathematical theory of codes, as used in communication, data compression, and cryptography.
The study of the computational complexity of problems with respect to more than one parameter.
Questions about space resources of computations in computational complexity or algorithms.
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…