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:
× 2566
Questions related to design and analysis of algorithms
× 1312
Questions related to the (computational) complexity of solving problems
× 869
Questions related to formal languages, grammars, and automata theory
× 636
Questions about properties of and problems on graphs, discrete data structures that have the form of nodes connected by edges, that is networks.
× 587
Questions about how specific notions have to be understood as well as conventions of notation.
× 571
Questions about graphs, discrete structures of nodes which are connected by edges. Popular flavors are trees and networks with edge capacity.
× 562
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 al…
× 545
Questions related to computability theory, a.k.a. recursion theory
× 531
Questions about ways of storing data so that it can be used advantageously by algorithms.
× 482
Questions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
× 443
Questions about the set of languages (equivalently) described by context-free grammars or accepted by (non-deterministic) pushdown automata.
× 441
Questions requesting papers in the literature on specific, narrow issues.
× 439
Questions about properties of the class of regular languages and individual languages.
× 406
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.
× 404
the amount of time resources (number of atomic operations or machine steps) required to solve a problem or run an algorithm with respect to the input size.
× 375
Questions about the hardest problems in NP, i.e. of those that can be solved in polynomial time by nondeterministic Turing machines.
× 351
Questions about problems that entail selecting the best element from some set of available alternatives, and methods to solve them.
× 349
Questions about asymptotic notations and analysis
× 341
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.
× 337
Questions about formal grammars, generative descriptions of formal languages.
× 323
Questions about finding mappings between problems that allow solving one problem using a solution of another one.
× 302
Questions about computer algorithms that automatically discover patterns in data and make good decisions based on them.
× 284
Questions related to design, implementation, and analysis of programming languages
× 271
Questions about the organization and design of computer hardware.
× 268
Questions related to mathematical logic and its use in computer science
× 254
Questions about methods for estimating the increase in runtime of an algorithm as the input size increases.
× 220
Questions about methods and techniques for proving theorems.
× 213
Questions algorithmic solutions of geometric problems.
× 211
Questions about problems which cannot be solved by any Turing machine.
× 210
Questions related to combinatorics and discrete mathematical structures
× 195
Questions about the principles of software that interfaces between hardware and applications.
× 188
a definition of a sequence where later elements are expressed as a function of earlier elements.
× 186
Algorithms for finding an element in some specified data-structure (most commonly, in a tree).
× 186
Questions about design and properties of agents that act in a dynamic environment and make decisions towards some goal without user control.
× 172
the algorithmic problem of ordering a set of elements with respect to some ordering relation.
× 157
at least as hard as NP-complete problems