The Stack Overflow podcast is back! Listen to an interview with our new CEO.


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.

× 2621
P versus NP and other resource-bounded computation.
× 1609
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
× 1352
used when the author needs to know about work related to the question.
× 1267
the study of graphs, mathematical structures used to model pairwise relations between objects.
× 846
Algorithms on graphs, excluding heuristics.
× 591
Questions related to combinatorics and discrete mathematical structures
× 551
Questions related to NP-hardness and NP-completeness.
× 537
Computational complexity classes and their relations
× 464
Computational and mathematical logic.
× 394
Questions about approximation algorithms.
× 372
formal languages, grammars, automata theory
× 353
a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
× 351
general questions about selecting a best element from some set of available alternatives.
× 334
Computability theory a.k.a. recursion theory.
× 333
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
× 333
Quantum computation and computational issues related to quantum mechanics
× 323
the study of resource-bounded circuits and the functions computed by such circuits.
× 316
Programming languages, in particular, focussing on their semantics.
× 309
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
× 291
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
× 289
Time complexity of decision problems or relations among time-bounded complexity classes. (Use [tag:analysis-of-algorithms] for the time taken by particular algorithms.)
× 262
a syntactic discipline for enforcing levels of abstraction.
× 256
SAT stands for the Boolean satisfiability problem.
× 251
the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
× 251
Theoretical aspects of cryptography and information security.
× 229
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
× 210
counting the number of solutions?
× 207
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
× 192
Questions in probability theory
× 185
Linear algebra deals with vector spaces and linear transformations.
× 183
a fundamental model of computation, especially in theoretical work.
× 181
Questions about Boolean functions and their analysis
× 174
for a "broad, overall view or perspective of an issue or problem."
× 171
determined by its input and a generator producing uniformly random numbers.
× 168
Mathematical and computational method for finding the best outcome in a given mathematical model where the list of requirements is represented as linear relationships.
× 165
Machine learning and learning theory: PAC learning, algorithmic learning theory, and computational aspects of Bayesian inference and graphical models.