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.
P versus NP and other resource-bounded computation.
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
used when the author needs to know about work related to the question.
the study of graphs, mathematical structures used to model pairwise relations between objects.
Questions related to combinatorics and discrete mathematical structures
Questions related to NP-hardness and NP-completeness.
Computational complexity classes and their relations
Questions about approximation algorithms.
a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
general questions about selecting a best element from some set of available alternatives.
Quantum computation and computational issues related to quantum mechanics
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
the study of resource-bounded circuits and the functions computed by such circuits.
Programming languages, in particular, focussing on their semantics.
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
Time complexity of decision problems or relations among time-bounded complexity classes. (Use [tag:analysis-of-algorithms] for the time taken by particular algorithms.)
Theoretical aspects of cryptography and information security.
a syntactic discipline for enforcing levels of abstraction.
the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
a fundamental model of computation, especially in theoretical work.
Linear algebra deals with vector spaces and linear transformations.
for a "broad, overall view or perspective of an issue or problem."
determined by its input and a generator producing uniformly random numbers.
the transformation of one problem into another problem. A example of using a reduction would be to be to show if a problem P is undecidable. This would be achieved by transforming or pe…