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.
Questions about the theory of regular expressions, both in the sense of Kleene's original definition and of POSIX regular expressions.
practical questions about doing research in theoretical computer science
Coq is an interactive theorem prover.
Theoretical questions in Databases
Questions about deterministic finite automata
Questions about analysis of proofs in theories
Descriptive complexity classifies problems based on how hard it is to express the problem in some logical formalism.
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 …
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…
Add X as a hypothesis, where X is not known to be either true or false.
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…
Formal methods are stringent mathematical techniques to model systems to verify their properties to guarantee reliability.
Probabilistically checkable proofs
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.
Questions about set theory
Theoretical questions in Neural and Evolutionary Computing
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…