Tags
A tag is a keyword or label that categorizes your question with other, similar questions.
An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Use this tag when your issue is related to design and analysis of algorithms.
11474 questions
Questions related to the (computational) complexity of solving problems
5431 questions
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
4895 questions
Questions related to formal languages, grammars, and automata theory
2858 questions
The amount of time resources (number of atomic operations or machine steps)
required to solve a problem expressed in terms of input size. If your question concerns algorithm analysis, use the [runtime-analysis] tag instead. If your question concerns whether or not a computation will *ever* finish, use the [computability] tag instead. Time-complexity is perhaps the most important sub-topic of complexity theory.
2614 questions
Questions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
2531 questions
Questions about ways of storing data so that it can be used advantageously by algorithms.
2166 questions
Questions about the science and art of determining properties of algorithms, often including correctness, runtime and space usage. Use the [runtime-analysis] tag for questions about the runtime of algorithms.
2011 questions
Questions about problems that entail selecting the best element from some set of available alternatives, and methods to solve them.
1828 questions
Questions about properties of the class of regular languages and individual languages.
1821 questions
Questions about mathematical devices that read an input stream symbol by symbol and use a state transition map to produce an output stream, maybe using secondary storage.
1794 questions
Questions about finite automata, an elementary automaton model with finite memory. It is equivalent to regular languages and the basis for many more complex models.
1757 questions
Questions about the set of languages (equivalently) described by context-free grammars or accepted by (non-deterministic) pushdown automata.
1715 questions
Questions about the hardest problems in NP, i.e. of those that can be solved in polynomial time by nondeterministic Turing machines.
1630 questions
In computability and complexity, finding mappings between problems that allow solving one problem using a solution of another one. For reduction in programming language theory (e.g. beta-reduction), see [lambda-calculus] or [term-rewriting].
1281 questions
Questions about formal grammars, generative descriptions of formal languages.
1266 questions
Questions about computer algorithms that automatically discover patterns in data and make good decisions based on them.
1220 questions
Questions about how specific notions have to be understood as well as conventions of notation.
1130 questions
Questions about the organization and design of computer hardware.
1129 questions
Questions about methods for estimating the increase in runtime of an algorithm as the input size increases.
1036 questions
Questions requesting papers in the literature on specific, narrow issues.
1030 questions
Questions related to design, implementation, and analysis of programming languages. NOT for questions about how to program, which are off-topic on this site.
990 questions
Questions about problems that can be solved by combining recursively obtained solutions of subproblems.
968 questions
the algorithmic problem of ordering a set of elements with respect to some ordering relation.
932 questions
Questions about algorithmic solutions of geometric problems, or other algorithms making usage of geometry.
863 questions
Questions about regular expressions, a formalism to describe regular languages.
841 questions
Questions about the principles of software that interfaces between hardware and applications.
782 questions
Questions about decision problems that can be solved on nondeterministic Turing machines in time polynomial in the length of the input.
766 questions
a definition of a sequence where later elements are expressed as a function of earlier elements.
730 questions