Theoretical Computer Science

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.

Show all tag synonyms
Popular Name New
94 questions
10 asked this year
A matching is a subset of the edges of a graph, such that no edge in the subset shares a vertex with another.
90 questions
4 asked this year
90 questions
8 asked this year
89 questions
3 asked this year
Questions about or related to P vs. NP
89 questions
6 asked this year
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.
88 questions
Questions about space resources of computations in computational complexity or algorithms.
87 questions
2 asked this year
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.
87 questions
6 asked this year
87 questions
10 asked this year
Used for questions about existing or possible proofs of a specific theorem or conjecture
86 questions
8 asked this year
The history behind the topics: where their name comes from, who discovered them, when they were first proved, how they evolved during the years.
85 questions
1 asked this year
85 questions
11 asked this year
84 questions
8 asked this year
82 questions
10 asked this year
81 questions
4 asked this year
78 questions
5 asked this year
Problems known to be open in the literature and any problem that, after being posed, is decided to be open by the community.
77 questions
1 asked this year
77 questions
3 asked this year
propositional proof systems and corresponding bounded arithmetic theories
76 questions
10 asked this year
75 questions
1 asked this year
algorithms for parameterized problems where the run-time is polynomial in the input size, but depends arbitrarily on the parameter
74 questions
1 asked this year
Questions arising from applications of theoretical computer science in other areas of computer science research/practice or other subjects.
73 questions
3 asked this year
73 questions
5 asked this year
73 questions
11 asked this year
72 questions
3 asked this year
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…
72 questions
2 asked this year
Questions relating to the *practice* of research in theoryCS
72 questions
71 questions
2 asked this year
69 questions
2 asked this year
69 questions
69 questions
3 asked this year
68 questions
7 asked this year
68 questions
1 asked this year
67 questions
6 asked this year
Theoretical questions about Artificial Intelligence
67 questions
5 asked this year
67 questions
3 asked this year
1 2
3
4 5
…
16

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.