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.
Questions about relationships between complexity classes.
Questions related to the (computational) complexity of solving problems
Questions related to computability theory, a.k.a. recursion theory
Questions about algorithmic solutions of geometric problems, or other algorithms making usage of geometry.
The definition of the set of allowable operations used for computation and their respective costs. Some examples of models include Turing machines, recursive functions, lambda calculus, and production…
Questions about the organization and design of computer hardware.
Questions about problems that arise when you connect multiple computers to form a network.
Questions about algorithms for processing and analyzing images and videos.
Questiont about issues of concurrency such as synchronization and deadlocks.
a complement of NP, i.e. decision problems where the "no" instances can be accepted by a nondeterministic Turing machine that runs in time polynomial in the…
A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes. use this tag for consensus kind of prob…
Questions about the set of languages (equivalently) described by context-free grammars or accepted by (non-deterministic) pushdown automata.
an interactive theorem prover based on the Calculus of Inductive Constructions.
Questions that ask for or about correctness proofs of algorithms.
usually used to refer counting objects in certain arrangements or with certain properties.