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.

Questions about the theory of regular expressions, both in the sense of Kleene's original definition and of POSIX regular expressions.
60 questions
Coq is an interactive theorem prover.
57 questions
55 questions
Add X as a hypothesis, where X is not known to be either true or false.
55 questions
Theoretical questions in Databases
53 questions
Descriptive complexity classifies problems based on how hard it is to express the problem in some logical formalism.
53 questions
Questions about deterministic finite automata
53 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 …
52 questions
Probabilistically checkable proofs
51 questions
Questions about analysis of proofs in theories
50 questions
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
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…
50 questions
Theoretical questions in Neural and Evolutionary Computing
50 questions
49 questions
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…
49 questions
A partial order is a binary relation over a set which is reflexive, antisymmetric, and transitive.
48 questions
Automated theorem proving is the proving of mathematical theorems by a computer program.
48 questions
A proof assistant is an application program that helps humans construct machine-checked proofs.
47 questions
questions about attaining and maintaining a career in fields related to theoretical computer science
47 questions
46 questions
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.
45 questions
1 2 3
4
5
16