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 principles of the object-oriented programming paradigm.
For questions about the usage and manipulation of Directed Acyclic Graphs (DAG).
Questions on Hamiltonian paths, that is, paths that visit each vertex exactly once in a graph.
A computational model composed of a grid of stateful cells and a set of rules describing when to change a cell's state.
Questions asking us to check whether your solution is correct are considered off-topic (per http://meta.cs.stackexchange.com/questions/597/) and should not be posted on this site.
a class of optimization problems in which one has to pack objects together as densely as possible. One could be for example packing rectangles inside a rectangle.
Questions about the design and analysis of machine learning algorithms.
off-topic here. Do not ask questions about how to write code in Python. However, conceptual questions about computer science are more appropriate. See our help center for the…
For questions about the interpretation, extension and validity of the Church-Turing thesis, the hypothesis that states that a function is effectively calculable by a human if and only if the function…
Machine-checked, machine-generated or machine-verified proofs
a general model of computation that investigates a wide range of (potentially non-deterministic) methods of replacing subterms of syntactic expression, more precisely an element of a…
Theoretical results and techniques applied in practical settings.
The edit distance (also: Levenshtein distance) between two strings measures the number of insertions and deletions it takes to convert one string to another.
Questions about algorithms that receive the input piecewise and have to make decisions, that is produce output, before having seen the whole input.
Questions about algorithms and data structures for storing, organizing, and naming data in durable storage systems.
Computational complexity with respect to one or more parameters of the input (apart from its plain length as a string), which capture intrinsically difficult instances
Questions about the concurrency-control requirement of ensuring that no two processes are simultaneously in a critical section (a period when the process is accessing a shared resource). Failing to a…
For questions about representing numbers in base 2 or performing arithmetic on them.
Questions about the fundamental component of an operating system, which manages the allocation of resources to applications.
an interactive theorem prover based on the Calculus of Inductive Constructions.