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:
× 1549
P versus NP and other resource-bounded computation.
× 1119
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
× 808
used when the author needs to know about work related to the question.
× 741
the study of graphs, mathematical structures used to model pairwise relations between objects.
× 492
Algorithms on graphs, excluding heuristics.
× 428
Questions related to combinatorics and discrete mathematical structures
× 299
Questions related to NP-hardness and NP-completeness.
× 275
Computational and mathematical logic.
× 269
Computational complexity classes and their relations
× 235
a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
× 224
formal languages, grammars, automata theory
× 213
the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
× 213
Questions about approximation algorithms.
× 210
Programming languages, in particular, focussing on their semantics.
× 204
Questions about properties and applications of data structures.
× 199
Theoretical aspects of cryptography and information security.
× 198
Computability theory a.k.a. recursion theory.
× 192
general questions about selecting a best element from some set of available alternatives.
× 184
Quantum computation and computational issues related to quantum mechanics
× 179
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
× 146
the study of resource-bounded circuits and the functions computed by such circuits.
× 143
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
× 138
SAT stands for the Boolean satisfiability problem.
× 137
Questions regarding the complexity of a particular algorithm or relations among time-bounded complexity classes
× 114
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
× 114
a big list of items (books, theorems, software, ...)
× 114
counting the number of solutions?
× 102
for a "broad, overall view or perspective of an issue or problem."
× 97
Questions about Turing machine computational model
× 94 × 90
Mathematical and computational method for finding the best outcome in a given mathematical model where the list of requirements is represented as linear relationships.
× 88
Machine learning and learning theory: PAC learning, algorithmic learning theory, and computational aspects of Bayesian inference and graphical models.
× 88
Questions in probability theory
× 85 × 84
a syntactic discipline for enforcing levels of abstraction.
× 84
Questions in Information Theory