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
55 questions
5 asked this year
54 questions
2 asked this year
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…
53 questions
4 asked this year
53 questions
5 asked this year
an interactive theorem prover.
52 questions
9 asked this year
Theoretical questions in Databases
52 questions
2 asked this year
51 questions
3 asked this year
51 questions
1 asked this year
Probabilistically checkable proofs
51 questions
3 asked this year
the study of systems that operate simultaneously. For example given a set of elevators and a pool of people who want to go to various floors. An example of a concurrent system would be …
50 questions
2 asked this year
Questions about deterministic finite automata
50 questions
1 asked this year
Descriptive complexity classifies problems based on how hard it is to express the problem in some logical formalism.
50 questions
4 asked this year
50 questions
2 asked this year
Theoretical questions in Neural and Evolutionary Computing
50 questions
49 questions
1 asked this year
a procedure that can apply generically to many problems (for example gradient descent, alternating optimization, simulated annealing) but will typically not have formal guarantees assoc…
49 questions
2 asked this year
49 questions
8 asked this year
49 questions
4 asked this year
Questions about the theory of regular expressions, both in the sense of Kleene's original definition and of POSIX regular expressions.
48 questions
1 asked this year
an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise dis…
48 questions
46 questions
46 questions
4 asked this year
the proving of mathematical theorems by a computer program.
46 questions
5 asked this year
45 questions
5 asked this year
45 questions
6 asked this year
45 questions
9 asked this year
a binary relation over a set which is reflexive, antisymmetric, and transitive.
44 questions
4 asked this year
44 questions
2 asked this year
Questions about analysis of proofs in theories
43 questions
5 asked this year
a sparse (low degree) graph with high "expansion," measured in one of several ways; typically akin to the minimum ratio of the size of a subgraph boundary to the subgraph's volume.
43 questions
2 asked this year
43 questions
2 asked this year
questions about attaining and maintaining a career in fields related to theoretical computer science
42 questions
42 questions
2 asked this year
42 questions
8 asked this year
41 questions
3 asked this year
VC-dimension (after Vapnik and Chervonenkis) is a measure of the power of a set of shapes (ranges) to realize subsets of points. VC-dimension is a vital analysis tool in the fields of machine learning…
41 questions
1 asked this year
1 2 3
4
5
…
15