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.
Reference-request is used when the author needs to know about work related to the question.
1537 questions
Graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects.
Algorithms on graphs, excluding heuristics.
Questions related to NP-hardness and NP-completeness.
Questions related to combinatorics and discrete mathematical structures
645 questions
Computational complexity classes and their relations
622 questions
Computational and mathematical logic.
504 questions
Questions about approximation algorithms.
470 questions
formal languages, grammars, automata theory
421 questions
general questions about selecting a best element from some set of available alternatives.
415 questions
A soft question is a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
402 questions
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
382 questions
Quantum computation and computational issues related to quantum mechanics
379 questions
Computability theory a.k.a. recursion theory.
374 questions
Type structure is a syntactic discipline for enforcing levels of abstraction.
368 questions
Circuit complexity is the study of resource-bounded circuits and the functions computed by such circuits.
362 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.)
358 questions
Programming languages, in particular, focussing on their semantics.
357 questions
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
336 questions
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
335 questions
SAT stands for the Boolean satisfiability problem.
306 questions
Computational Geometry is the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
268 questions
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
264 questions
Theoretical aspects of cryptography and information security.
256 questions
How hard is counting the number of solutions?
250 questions
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
248 questions
Questions in probability theory
230 questions
Linear algebra deals with vector spaces and linear transformations.
215 questions
The Turing machine is a fundamental model of computation, especially in theoretical work.
209 questions
Questions about Boolean functions and their analysis
202 questions
An algorithm whose behaviour is determined by its input and a generator producing uniformly random numbers.
198 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.
191 questions
A reduction is 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…
191 questions
Questions in Information Theory
190 questions
2 3 4 5