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.
P versus NP and other resource-bounded computation.
3104 questions
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
1850 questions
Reference-request is used when the author needs to know about work related to the question.
1650 questions
Graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects.
1566 questions
Computational complexity classes and their relations
688 questions
Questions related to combinatorics and discrete mathematical structures
678 questions
general questions about selecting a best element from some set of available alternatives.
456 questions
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
441 questions
A soft question is a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
420 questions
Time complexity of decision problems or relations among time-bounded complexity classes. (Use the [analysis-of-algorithms] tag for the time taken by particular algorithms.)
412 questions
Quantum computation and computational issues related to quantum mechanics
411 questions
Type structure is a syntactic discipline for enforcing levels of abstraction.
410 questions
Circuit complexity is the study of resource-bounded circuits and the functions computed by such circuits.
398 questions
Programming languages, in particular, focussing on their semantics.
378 questions
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
367 questions
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
359 questions
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
281 questions
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
273 questions
Computational Geometry is the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
272 questions
Theoretical aspects of cryptography and information security.
262 questions
The Turing machine is a fundamental model of computation, especially in theoretical work.
247 questions
Linear algebra deals with vector spaces and linear transformations.
229 questions
Questions about Boolean functions and their analysis
227 questions
A reduction is the transformation of one problem into another problem. A example of using a reduction would be to be to show if a problem P is undecidable. This would be achieved by transforming or pe…
217 questions
An algorithm whose behaviour is determined by its input and a generator producing uniformly random numbers.
215 questions
Mathematical and computational method for finding the best outcome in a given mathematical model where the list of requirements is represented as linear relationships.
214 questions