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.
not known to be either true or false.
Theoretical questions in Databases
Descriptive complexity classifies problems based on how hard it is to express the problem in some logical formalism.
Questions about the theory of regular expressions, both in the sense of Kleene's original definition and of POSIX regular expressions.
Questions about deterministic finite automata
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 …
Probabilistically checkable proofs
an interactive theorem prover.
Theoretical questions in Neural and Evolutionary Computing
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…
an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise dis…
a binary relation over a set which is reflexive, antisymmetric, and transitive.
the proving of mathematical theorems by a computer program.
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…
Questions about analysis of proofs in theories
questions about attaining and maintaining a career in fields related to theoretical computer science
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.