Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange


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.

× 2533
P versus NP and other resource-bounded computation.
× 1577
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
× 1288
used when the author needs to know about work related to the question.
× 1226
the study of graphs, mathematical structures used to model pairwise relations between objects.
× 822
Algorithms on graphs, excluding heuristics.
× 576
Questions related to combinatorics and discrete mathematical structures
× 532
Questions related to NP-hardness and NP-completeness.
× 521
Computational complexity classes and their relations
× 448
Computational and mathematical logic.
× 385
Questions about approximation algorithms.
× 358
formal languages, grammars, automata theory
× 347
a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
× 342
general questions about selecting a best element from some set of available alternatives.
× 328
Computability theory a.k.a. recursion theory.
× 318
Quantum computation and computational issues related to quantum mechanics
× 314
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
× 313
the study of resource-bounded circuits and the functions computed by such circuits.
× 304
Programming languages, in particular, focussing on their semantics.
× 297
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
× 271
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
× 267
Time complexity of decision problems or relations among time-bounded complexity classes. (Use [tag:analysis-of-algorithms] for the time taken by particular algorithms.)
× 248
Theoretical aspects of cryptography and information security.
× 247
a syntactic discipline for enforcing levels of abstraction.
× 247
the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
× 245
SAT stands for the Boolean satisfiability problem.
× 221
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
× 198
counting the number of solutions?
× 197
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
× 181
a fundamental model of computation, especially in theoretical work.
× 181
Questions in probability theory
× 180
Linear algebra deals with vector spaces and linear transformations.
× 165
for a "broad, overall view or perspective of an issue or problem."
× 162
determined by its input and a generator producing uniformly random numbers.
× 162
Questions about Boolean functions and their analysis
× 157
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…
× 155
Machine learning and learning theory: PAC learning, algorithmic learning theory, and computational aspects of Bayesian inference and graphical models.