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.
Algorithms on graphs, excluding heuristics.
Questions related to combinatorics and discrete mathematical structures
600 questions
Questions related to NP-hardness and NP-completeness.
595 questions
Computational complexity classes and their relations
565 questions
Computational and mathematical logic.
Questions about approximation algorithms.
417 questions
formal languages, grammars, automata theory
386 questions
a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
378 questions
general questions about selecting a best element from some set of available alternatives.
365 questions
Quantum computation and computational issues related to quantum mechanics
357 questions
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
350 questions
Computability theory a.k.a. recursion theory.
348 questions
the study of resource-bounded circuits and the functions computed by such circuits.
333 questions
Programming languages, in particular, focussing on their semantics.
326 questions
Time complexity of decision problems or relations among time-bounded complexity classes. (Use the [analysis-of-algorithms] tag for the time taken by particular algorithms.)
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
316 questions
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
306 questions
a syntactic discipline for enforcing levels of abstraction.
291 questions
SAT stands for the Boolean satisfiability problem.
the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
257 questions
Theoretical aspects of cryptography and information security.
251 questions
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
236 questions
counting the number of solutions?
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
219 questions
Questions in probability theory
201 questions
a fundamental model of computation, especially in theoretical work.
193 questions
Linear algebra deals with vector spaces and linear transformations.
189 questions
Questions about Boolean functions and their analysis
187 questions
for a "broad, overall view or perspective of an issue or problem."
179 questions
determined by its input and a generator producing uniformly random numbers.
179 questions
Mathematical and computational method for finding the best outcome in a given mathematical model where the list of requirements is represented as linear relationships.
Machine learning and learning theory: PAC learning, algorithmic learning theory, and computational aspects of Bayesian inference and graphical models.
175 questions
2 3 4 5