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
Join us in building a kind, collaborative learning community via our updated Code of Conduct.

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.

× 2470
P versus NP and other resource-bounded computation.
× 1561
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
× 1265
used when the author needs to know about work related to the question.
× 1218
the study of graphs, mathematical structures used to model pairwise relations between objects.
× 812
Algorithms on graphs, excluding heuristics.
× 571
Questions related to combinatorics and discrete mathematical structures
× 515
Questions related to NP-hardness and NP-completeness.
× 504
Computational complexity classes and their relations
× 436
Computational and mathematical logic.
× 372
Questions about approximation algorithms.
× 347
formal languages, grammars, automata theory
× 332
general questions about selecting a best element from some set of available alternatives.
× 329
a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
× 324
Computability theory a.k.a. recursion theory.
× 310
Quantum computation and computational issues related to quantum mechanics
× 304
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
× 304
the study of resource-bounded circuits and the functions computed by such circuits.
× 296
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
× 291
Programming languages, in particular, focussing on their semantics.
× 256
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
× 253
Time complexity of decision problems or relations among time-bounded complexity classes. (Use [tag:analysis-of-algorithms] for the time taken by particular algorithms.)
× 249
the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
× 245
Theoretical aspects of cryptography and information security.
× 243
SAT stands for the Boolean satisfiability problem.
× 220
a syntactic discipline for enforcing levels of abstraction.
× 214
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
× 189
counting the number of solutions?
× 183
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
× 175
Linear algebra deals with vector spaces and linear transformations.
× 175
Questions in probability theory
× 172
a fundamental model of computation, especially in theoretical work.
× 165
for a "broad, overall view or perspective of an issue or problem."
× 161
Questions about Boolean functions and their analysis
× 156
determined by its input and a generator producing uniformly random numbers.
× 153
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…
× 151
Mathematical and computational method for finding the best outcome in a given mathematical model where the list of requirements is represented as linear relationships.