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
67 questions
6 asked this year
67 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.
66 questions
4 asked this year
practical questions about doing research in theoretical computer science
65 questions
62 questions
4 asked this year
Coq is an interactive theorem prover.
62 questions
4 asked this year
61 questions
1 asked this year
Theoretical questions in Databases
60 questions
5 asked this year
60 questions
6 asked this year
Questions about deterministic finite automata
60 questions
6 asked this year
59 questions
4 asked this year
58 questions
Questions about analysis of proofs in theories
57 questions
1 asked this year
57 questions
2 asked this year
56 questions
5 asked this year
Descriptive complexity classifies problems based on how hard it is to express the problem in some logical formalism.
56 questions
3 asked this year
Concurrency is 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 …
56 questions
2 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…
56 questions
2 asked this year
Add X as a hypothesis, where X is not known to be either true or false.
56 questions
1 asked this year
54 questions
4 asked this year
53 questions
6 asked this month, 11 this year
The travelling salesman problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise dis…
53 questions
2 asked this year
53 questions
4 asked this year
Formal methods are stringent mathematical techniques to model systems to verify their properties to guarantee reliability.
52 questions
6 asked this year
52 questions
1 asked this year
Probabilistically checkable proofs
52 questions
52 questions
4 asked this year
An expander is 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.
51 questions
5 asked this year
51 questions
2 asked this year
51 questions
4 asked this year
51 questions
3 asked this year
Questions about set theory
50 questions
3 asked this year
Theoretical questions in Neural and Evolutionary Computing
50 questions
50 questions
3 asked this year
A heuristic is 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…
50 questions
49 questions
2 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.