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.

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