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.
ds.algorithms× 1577
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
graph-theory× 1226
the study of graphs, mathematical structures used to model pairwise relations between objects.
soft-question× 347
a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
optimization× 342
general questions about selecting a best element from some set of available alternatives.
automata-theory× 314
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
circuit-complexity× 313
the study of resource-bounded circuits and the functions computed by such circuits.
ds.data-structures× 297
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
machine-learning× 271
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
time-complexity× 267
Time complexity of decision problems or relations among time-bounded complexity classes. (Use [tag:analysis-of-algorithms] for the time taken by particular algorithms.)
cg.comp-geom× 247
the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
lower-bounds× 221
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
lambda-calculus× 197
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
randomized-algorithms× 162
determined by its input and a generator producing uniformly random numbers.
reductions× 157
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…
lg.learning× 155
Machine learning and learning theory: PAC learning, algorithmic learning theory, and computational aspects of Bayesian inference and graphical models.
