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.

× 481
Algorithms for finding an element in some specified data-structure (most commonly, in a tree).
× 475
a definition of a sequence where later elements are expressed as a function of earlier elements.
× 456
Questions about the algorithmic problems of finding shortest paths between nodes in a graph.
× 442
Questions about programs that read code in one language (source language) and translate it into an equivalent program in another language (target language).
× 441
Questions about decision problems that can be solved on nondeterministic Turing machines in time polynomial in the length of the input.
× 440
Questions about design and properties of agents that act in a dynamic environment and make decisions towards some goal without user control.
× 414
the problem of determining whether there is a variable assignment that fulfills a given Boolean formula.
× 394
a formal system for function definition, function application and recursion which forms the mathematical basis of functional programming.
× 394
Network structure inspired by simplified models of biological neurons (brain cells). Neural networks are trained to "learn" by supervised and unsupervised techniques, and can be used to solve optimiz…
× 385
Questions about algorithms that solve problems up to some bounded error.
× 384
a tree in which each node has no more than two children
× 377
formal systems to specify properties of objects
× 362
A sequential random-access data structure whose size can typically not be changed after creation.
× 360
A question in some formal system with a yes-or-no answer.
× 357
Questions about objects such as functions, algorithms or data structures that are expressed using "smaller" instances of themselves.
× 355
Questions about state machines with a single stack for memory. They characterize the class of context-free languages.
× 352
Questions about sequences of symbols, sets thereof and their properties as well as uses.
× 350
Necessary properties of formal langagues in certain classes that rely on closure against repetition of certain subwords. Make sure your question isn't covered by applying the techniques in https://cs…
× 348
The definition of the set of allowable operations used for computation and their respective costs. Some examples of models include Turing machines, recursive functions, lambda calculus, and production…
× 324
Asymptotic analyses of the space needed to run algorithms.
× 324
Questions about relationships between complexity classes.
× 323
Questions about the branch of mathematics concerned with modelling and analysing random phenomena.
× 303
Questions about operations on objects of some kind that result in objects of the same kind.
× 300
Questions about discrete mathematics, the study of mathematical structures that are fundamentally discrete rather than continuous.
× 299
Questions about the challenges of solving problems with multiple cooperating but separate agents.
× 287
Questions about algorithms that decide whether a given string belongs to a fixed formal language.
× 284
Questions about algorithms whose behaviour is determined not only by its input but also by a source of random numbers.
× 284
Questions about graph traversal algorithms such as BFS and DFS.
× 272
Questions about finite and infinite sets and multisets, related data structures and concepts.
× 272
Optimization with a linear objective function, subject to linear equality and linear inequality constraints.
× 268
a programming paradigm which primarily uses functions as means for building abstractions and expressing computations that comprise a computer program.
× 266
Questions that ask for or about correctness proofs of algorithms.
× 263
Questions concerning the Halting problem which is to decide whether a given a program halts on a given input.
× 262
Questions about search trees, a class of data structures used for storing sorted data for efficient access.
× 261
Use for algorithms, algorithm-analysis and complexity-theory questions that aim for polynomial running time resp. time complexity. Such questions often are are reference-requests or about runtime-anal…
× 259
Questions about automata, formal grammars or other computation-models that specifically relate to the use of nondeterminism. Not to be confused with randomness or ambiguity!