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.
Graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects.
Algorithms on graphs, excluding heuristics.
964 questions
Questions related to NP-hardness and NP-completeness.
642 questions
Questions related to combinatorics and discrete mathematical structures
628 questions
Computational complexity classes and their relations
605 questions
Computational and mathematical logic.
494 questions
Questions about approximation algorithms.
456 questions
formal languages, grammars, automata theory
411 questions
general questions about selecting a best element from some set of available alternatives.
403 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.
397 questions
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
374 questions
Quantum computation and computational issues related to quantum mechanics
371 questions
Computability theory a.k.a. recursion theory.
364 questions
Circuit complexity is the study of resource-bounded circuits and the functions computed by such circuits.
353 questions
Type structure is a syntactic discipline for enforcing levels of abstraction.
Programming languages, in particular, focussing on their semantics.
349 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.)
343 questions
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
328 questions
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
325 questions
SAT stands for the Boolean satisfiability problem.
292 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…
267 questions
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
257 questions
Theoretical aspects of cryptography and information security.
256 questions
How hard is counting the number of solutions?
239 questions
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
236 questions
Questions in probability theory
217 questions
Linear algebra deals with vector spaces and linear transformations.
207 questions
The Turing machine is a fundamental model of computation, especially in theoretical work.
206 questions
An algorithm whose behaviour is determined by its input and a generator producing uniformly random numbers.
194 questions
Questions about Boolean functions and their analysis
194 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.
189 questions
The big picture tag is for a "broad, overall view or perspective of an issue or problem."
185 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…
2 3 4 5