Tags

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.

× 60
Questions about the principles of the object-oriented programming paradigm.
× 58
For questions about the usage and manipulation of Directed Acyclic Graphs (DAG).
× 57
Questions on Hamiltonian paths, that is, paths that visit each vertex exactly once in a graph.
× 56
A computational model composed of a grid of stateful cells and a set of rules describing when to change a cell's state.
× 52
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.
× 52
Questions about different distance metrics on strings.
× 52
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.
× 52
Questions about the design and analysis of machine learning algorithms.
× 51
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…
× 50
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…
× 49
Machine-checked, machine-generated or machine-verified proofs
× 49
type systems of programming languages
× 49
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…
× 48
Theoretical results and techniques applied in practical settings.
× 48
The edit distance (also: Levenshtein distance) between two strings measures the number of insertions and deletions it takes to convert one string to another.
× 48
Questions about algorithms that receive the input piecewise and have to make decisions, that is produce output, before having seen the whole input.
× 46
Questions about algorithms and data structures for storing, organizing, and naming data in durable storage systems.
× 46
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
× 46
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…
× 45
For questions about representing numbers in base 2 or performing arithmetic on them.
× 44
Questions about the fundamental component of an operating system, which manages the allocation of resources to applications.
× 44
an interactive theorem prover based on the Calculus of Inductive Constructions.
× 44
a transformation of information to make it unreadable to outside observers