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
Theoretical questions about Artificial Intelligence
63 questions
2 asked this year
63 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.
63 questions
4 asked this year
63 questions
1 asked this year
61 questions
6 asked this year
60 questions
4 asked this year
Coq is an interactive theorem prover.
58 questions
2 asked this year
58 questions
2 asked this year
56 questions
1 asked this year
Questions about analysis of proofs in theories
56 questions
6 asked this year
Theoretical questions in Databases
55 questions
2 asked this year
55 questions
2 asked this year
Add X as a hypothesis, where X is not known to be either true or false.
55 questions
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 …
55 questions
3 asked this year
Questions about deterministic finite automata
54 questions
1 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…
54 questions
5 asked this year
53 questions
2 asked this year
Descriptive complexity classifies problems based on how hard it is to express the problem in some logical formalism.
53 questions
Probabilistically checkable proofs
52 questions
1 asked 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…
52 questions
3 asked this year
51 questions
2 asked this year
51 questions
1 asked this year
51 questions
4 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
Theoretical questions in Neural and Evolutionary Computing
50 questions
50 questions
2 asked this year
Automated theorem proving is the proving of mathematical theorems by a computer program.
49 questions
1 asked this year
49 questions
49 questions
2 asked this year
A partial order is a binary relation over a set which is reflexive, antisymmetric, and transitive.
48 questions
Questions about set theory
48 questions
7 asked this year
48 questions
5 asked this year
47 questions
2 asked this year
47 questions
1 asked this year
47 questions
1 asked this year
A proof assistant is an application program that helps humans construct machine-checked proofs. General questions about proof assistants can also be asked on the Proof Assistants Stack Exchange site.
47 questions
1 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.