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.
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…
Questions related to general, high level, techniques for the design of algorithms.
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.
A method in analysis of algorithms that considers the overall cost of a sequence of operations.
a form of declarative programming oriented towards NP-hard search problems
Theoretical results and techniques applied in practical settings.
Questions about algorithms that solve problems up to some bounded error.
A sequential random-access data structure whose size can typically not be changed after creation.
Questions about design and properties of agents that act in a dynamic environment and make decisions towards some goal without user control.
For questions about the [assignment problem](https://en.wikipedia.org/wiki/Assignment_problem) in combinatorial optimization, **not** for problems that you've been set as a homework assignment.
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.
Machine-checked, machine-generated or machine-verified proofs