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.

× 2593
P versus NP and other resource-bounded computation.
× 1602
Questions regarding well-defined instructions for completing a task, and relevant analysis in terms of time/memory/etc.
× 1330
used when the author needs to know about work related to the question.
× 1245
the study of graphs, mathematical structures used to model pairwise relations between objects.
× 833
Algorithms on graphs, excluding heuristics.
× 582
Questions related to combinatorics and discrete mathematical structures
× 544
Questions related to NP-hardness and NP-completeness.
× 529
Computational complexity classes and their relations
× 456
Computational and mathematical logic.
× 392
Questions about approximation algorithms.
× 365
formal languages, grammars, automata theory
× 351
a question (possibly subjective) about the field of theoretical computer science as opposed to being a question in theoretical computer science.
× 347
general questions about selecting a best element from some set of available alternatives.
× 331
Computability theory a.k.a. recursion theory.
× 328
Quantum computation and computational issues related to quantum mechanics
× 325
Automata Theory, including abstract machines, grammars, parsing, grammatical inference, transducers, and finite-state techniques
× 320
the study of resource-bounded circuits and the functions computed by such circuits.
× 313
Programming languages, in particular, focussing on their semantics.
× 306
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
× 282
Theoretical questions about Machine learning, especially Computational Learning Theory, including Algorithmic Learning Theory, PAC learning, and Bayesian Inference
× 281
Time complexity of decision problems or relations among time-bounded complexity classes. (Use [tag:analysis-of-algorithms] for the time taken by particular algorithms.)
× 253
a syntactic discipline for enforcing levels of abstraction.
× 251
SAT stands for the Boolean satisfiability problem.
× 249
the study of geometric problems from a computational perspective. Examples of problems include: computation of geometric objects such as convex hulls, dimensionality reductio…
× 248
Theoretical aspects of cryptography and information security.
× 229
questions about lowerbounds on functions, usually the complexity of an algorithm or a problem
× 205
counting the number of solutions?
× 202
Church's formal system used in computatability, programming languages and proof theory to represent effective functions, programs and their computation, and proofs.
× 187
Questions in probability theory
× 181
a fundamental model of computation, especially in theoretical work.
× 180
Linear algebra deals with vector spaces and linear transformations.
× 172
for a "broad, overall view or perspective of an issue or problem."
× 171
Questions about Boolean functions and their analysis
× 167
determined by its input and a generator producing uniformly random numbers.
× 167
Mathematical and computational method for finding the best outcome in a given mathematical model where the list of requirements is represented as linear relationships.
× 161
Machine learning and learning theory: PAC learning, algorithmic learning theory, and computational aspects of Bayesian inference and graphical models.