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.
Problems known to be open in the literature and any problem that, after being posed, is decided to be open by the community.
The history behind the topics: where their name comes from, who discovered them, when they were first proved, how they evolved during the years.
equal to the length of the shortest program computing s and halting. Measures the lack of structure in a string.
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…
Used for questions about existing or possible proofs of a specific theorem or conjecture
Questions arising from applications of theoretical computer science in other areas of computer science research/practice or other subjects.
a subset of the edges of a graph, such that no edge in the subset shares a vertex with another.
Questions relating to the *practice* of research in theoryCS
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.
practical questions about doing research in theoretical computer science
propositional proof systems and corresponding bounded arithmetic theories
algorithms for parameterized problems where the run-time is polynomial in the input size, but depends arbitrarily on the parameter
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…