Tags
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.
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…
199 questions
The big picture tag is for a "broad, overall view or perspective of an issue or problem."
194 questions
Hardness of approximation, aka inapproximability.
191 questions
Questions whose answers are a big list of items (books, theorems, software, ...)
171 questions
166 questions
Randomness is a key component of probabilistic algorithms, many combinatorial aarguments, the analysis of hashing functions, and in cryptography, among other applications.
163 questions
148 questions
Questions regarding the amount of communication needed to accomplish a
computational task, when the information about the task is spread across
several agents
142 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…
136 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.
135 questions
129 questions
An overlapping feature of type theory and type systems.
129 questions
Theoretical issues related to the quantum treatment of information
128 questions
128 questions
The mathematical theory of codes, as used in communication, data compression, and cryptography.
125 questions
125 questions
120 questions
Given a sequence of elements, find a permutation such that the elements are in a certain order.
120 questions
120 questions
116 questions
The study of the computational complexity of problems with respect to more than one parameter.
112 questions
Theoretical question related to Computer Science and Game Theory
111 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…
108 questions
106 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 …
105 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…
105 questions
101 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…
98 questions
95 questions
questions about definitions, terms, and common names in theoretical computer science.
94 questions