Theory Of Computation

Related Fields

Parent Topic:

Mathematics, Computer Science, Programming language, Algorithm

Child Topic:

Average-case complexity, Complexity class, Computable function, Structural complexity theory, Asymptotic computational complexity, Circuit complexity, Interactive proof system, co-NP, PSPACE, Oracle machine, Many-one reduction, Arithmetical set, Computability theory, Probabilistically checkable proof, Complete, EXPSPACE, Search problem, Savitch's theorem, Polynomial-time reduction, DFA minimization, Bounded quantifier, Büchi automaton, Deterministic automaton, Function problem, Recursively enumerable language, DSPACE, Grzegorczyk hierarchy, Analytical hierarchy, Parity function, Deterministic finite automaton, Arithmetical hierarchy, Graph isomorphism problem, Model of computation, Deterministic pushdown automaton, Operator-precedence grammar, EXPTIME, Powerset construction, Pushdown automaton, Effective dimension, Semantic gap, Descriptive complexity theory, 3SUM, Promise problem, Computational problem, Recursively enumerable set, Busy beaver, Proof of knowledge, Fast-growing hierarchy, True quantified Boolean formula, Quantum complexity theory, Rewriting, Rice's theorem, Pseudorandom generator, Computability, Nondeterministic finite automaton, Embedded pushdown automaton, NEXPTIME, Numbering, Decision tree model, Implication table, NTIME, Kleene's recursion theorem, Randomized algorithm, NC, Double recursion, Markov algorithm, PSPACE-complete, NSPACE, Timed automaton, Greibach normal form, Context-sensitive language, Computational resource, Semi-Thue system, Turing degree, Reduction, Entscheidungsproblem, Cook–Levin theorem, Alternating Turing machine, Log-space reduction, Space hierarchy theorem, Element distinctness problem, ω-automaton, Recursive language, Computational complexity theory, Nested word, FP, Counting problem, Boolean circuit, Reduction, ReDoS, Time complexity, Unrestricted grammar, Decision problem, Probabilistic Turing machine, Maximal set, Time hierarchy theorem, Gap theorem, Turing reduction, Modal μ-calculus, Non-deterministic Turing machine, Sparse language

Top Authors

Paper Recommendation
1974 The Design and Analysis of Computer Algorithms

1988 Numerical Recipes in C: The Art of Scientific Computing

1992 Adaptation in Natural and Artificial Systems

1997 Self-organizing Maps

1987 Digital Image Processing

2001 Introduction To Algorithms

1995 Neural Networks For Pattern Recognition

1991 Elements of information Theory

1990 A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition

1978 Digital Image Processing

2000 Quantum Computation and Quantum information

1985 Computational Geometry: An introduction

1988 An introduction To Computing With Neural Nets

1991 Vector Quantization and Signal Compression

1969 Formal Languages and Their Relation To Automata

1974 Judgment Under Uncertainty: Heuristics and Biases

1961 Error-correcting Codes

1990 Computers and intractability; A Guide To The Theory of NP-Completeness

1986 A Robust Layered Control System For A Mobile Robot

2000 Multiple View Geometry in Computer Vision