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: |
|
algorithms× 863
Questions related to design and analysis of algorithms
|
complexity-theory× 455
Questions related to the (computational) complexity of solving problems
|
formal-languages× 309
Questions related to formal languages, grammars, and automata theory
|
graph-theory× 220
Questions about properties of and problems on graphs, discrete data structures that have the form of nodes connected by edges, that is networks.
|
|
terminology× 212
Questions about how specific notions have to be understood as well as conventions of notation.
|
computability× 197
Questions related to computability theory, a.k.a. recursion theory
|
graphs× 174
Questions about graphs, discrete structures of nodes which are connected by edges. Popular flavors are trees and networks with edge capacity.
|
reference-request× 173
if you ask for pointers to material for self-study.
|
|
data-structures× 161
Questions about ways of storing data so that it can be used advantageously by algorithms.
|
algorithm-analysis× 159
Questions about the science and art of determining properties of algorithms, often including correctness, runtime and space usage.
|
regular-languages× 153
Questions about properties of the class of regular languages and individual languages.
|
time-complexity× 153
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.
|
|
turing-machines× 153
Questions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
|
context-free× 150
Questions about the set of languages (equivalently) described by context-free grammars or accepted by (non-deterministic) pushdown automata.
|
np-complete× 137
Questions about the hardest problems in NP, i.e. of those that can be solved in polynomial time by nondeterministic Turing machines.
|
automata× 130
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.
|
|
formal-grammars× 123
Questions about formal grammars, generative descriptions of formal languages.
|
reductions× 123
Questions about finding mappings between problems that allow solving one problem using a solution of another one.
|
asymptotics× 114
Questions about asymptotic notations and analysis
|
programming-languages× 108
Questions related to design, implementation, and analysis of programming languages
|
|
logic× 107
Questions related to logic and its use in computer science
|
finite-automata× 104
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.
|
optimization× 96
Questions about problems that entail selecting the best element from some set of available alternatives, and methods to solve them.
|
proof-techniques× 92
Questions about methods and techniques for proving theorems.
|
|
machine-learning× 82
Questions about computer algorithms that automatically discover patterns in data and make good decisions based on them.
|
combinatorics× 76
Questions related to combinatorics and discrete mathematical structures
|
undecidability× 74
Questions about problems which cannot be solved by any Turing machine.
|
runtime-analysis× 66
Questions about methods for estimating the increase in runtime of an algorithm as the input size increases.
|
|
computer-architecture× 62
Questions related to the design of computer hardware.
|
artificial-intelligence× 62
Questions about design and properties of agents that act in a dynamic environment and make decisions towards some goal without user control.
|
recurrence-relation× 59
a definition of a sequence where later elements are expressed as a function of earlier elements.
|
operating-systems× 59
Questions about the principles of software that interfaces between hardware and applications.
|
|
computational-geometry× 57
Questions algorithmic solutions of geometric problems.
|
dynamic-programming× 55
Questions about problems that can be solved by combining recursively obtained solutions of subproblems.
|
compilers× 54
Questions about programs that read code in one language (source language) and translate it into an equivalent program in another language (target language).
|
probability-theory× 54
Questions about the branch of mathematics concerned with modelling and analysing random phenomena.
|
