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.

Type to find tags:
× 1842
P versus NP and other resource-bounded computation.
× 1280
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
× 954
used when the author needs to know about work related to the question.
× 918
the study of graphs, mathematical structures used to model pairwise relations between objects.
× 617
Algorithms on graphs, excluding heuristics.
× 479
Questions related to combinatorics and discrete mathematical structures
× 343
Questions related to NP-hardness and NP-completeness.
× 334
Computational and mathematical logic.
× 329
Computational complexity classes and their relations
× 271
a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
× 262
Questions about approximation algorithms.
× 253
formal languages, grammars, automata theory
× 247
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
× 242
Programming languages, in particular, focussing on their semantics.
× 239
Computability theory a.k.a. recursion theory.
× 237
general questions about selecting a best element from some set of available alternatives.
× 231
the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
× 225
Quantum computation and computational issues related to quantum mechanics
× 215
Theoretical aspects of cryptography and information security.
× 210
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
× 185
Time complexity of decision problems or relations among time-bounded complexity classes. (Use [tag:analysis-of-algorithms] for the time taken by particular algorithms.)
× 184
the study of resource-bounded circuits and the functions computed by such circuits.
× 173
SAT stands for the Boolean satisfiability problem.
× 171
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
× 143
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
× 142
counting the number of solutions?
× 132
a big list of items (books, theorems, software, ...)
× 130
a syntactic discipline for enforcing levels of abstraction.
× 126
Questions in probability theory
× 122
Linear algebra deals with vector spaces and linear transformations.
× 121
for a "broad, overall view or perspective of an issue or problem."
× 113
a fundamental model of computation, especially in theoretical work.
× 106
Mathematical and computational method for finding the best outcome in a given mathematical model where the list of requirements is represented as linear relationships.
× 104
Machine learning and learning theory: PAC learning, algorithmic learning theory, and computational aspects of Bayesian inference and graphical models.
× 104
The Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
× 104
Questions in Information Theory