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 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.
A matching is a subset of the edges of a graph, such that no edge in the subset shares a vertex with another.
Questions about space resources of computations in computational complexity or algorithms.
The history behind the topics: where their name comes from, who discovered them, when they were first proved, how they evolved during the years.
Questions about or related to P vs. NP
Questions regarding the treewidth of graphs. Graphs of low treewidth admit fast divide-and-conquer algorithms for many graph problems that are NP-hard on general graphs.
Used for questions about existing or possible proofs of a specific theorem or conjecture
Problems known to be open in the literature and any problem that, after being posed, is decided to be open by the community.
algorithms for parameterized problems where the run-time is polynomial in the input size, but depends arbitrarily on the parameter
Questions relating to the *practice* of research in theoryCS
Clustering is an unsupervised learning problem. It deals with finding "clusters" or groups in a collection of unlabeled data. A cluster is therefore a collection of objects which are “similar” and ar…
Questions arising from applications of theoretical computer science in other areas of computer science research/practice or other subjects.
propositional proof systems and corresponding bounded arithmetic theories
practical questions about doing research in theoretical computer science
Questions about the theory of regular expressions, both in the sense of Kleene's original definition and of POSIX regular expressions.
Theoretical questions about Artificial Intelligence