Login
中文
Theory Of Computation
Related Fields
Anything in here will be replaced on browsers that support the canvas element
Numerical analysis
Knowledge representation and reasoning
Data structure
Algorithm
Discrete mathematics
Information retrieval
Model of computation
Logic
Computational geometry
Computational complexity theory
Computational model
Computer simulation
Machine learning
Graph theory
Computability
Mathematical analysis
Computer hardware
Computer Science
Artificial intelligence
Computer network
Mathematical optimization
Distributed computing
Verification and validation
Information system
Computability theory
Parent Topic:
Theoretical computer science
,
Discrete mathematics
,
Artificial intelligence
,
Computer Science
,
Mathematics
,
Algorithm
,
Programming language
Child Topic:
Average-case complexity
,
Complexity class
,
Computable function
,
Circuit complexity
,
Interactive proof system
,
Structural complexity theory
,
Asymptotic computational complexity
,
co-NP
,
PSPACE
,
Oracle machine
,
Many-one reduction
,
Arithmetical set
,
Computability theory
,
Probabilistically checkable proof
,
Complete
,
Search problem
,
EXPSPACE
,
Savitch's theorem
,
Polynomial-time reduction
,
DFA minimization
,
Bounded quantifier
,
Büchi automaton
,
Deterministic automaton
,
Function problem
,
Recursively enumerable language
,
DSPACE
,
Parity function
,
Grzegorczyk hierarchy
,
Analytical hierarchy
,
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:
Oded Goldreich
Kenneth W Regan
R Srikant
Paulo A S Veloso
Sanjay Jain
Kengo Sugahara
John Mikhail
Timo Kotzing
John R Birge
Thomas Streicher
Benjamin Doerr
Joseph Sifakis
Rafail Ostrovsky
Patrick W Fink
Jerzy Mycka
Ralf Hinze
Michael A Khayat
Amos Beimel
Oliver Deussen
Johan Hastad
Andrew Chichih Yao
Indika Meedeniya
Alejandro Javier Garcia
Rida T Farouki
Lotfi A Zadeh
Diego C Martinez
Mikael Goldmann
Sydney S Cash
Jinyi Cai
Gilles Brassard
Guillermo Ricardo Simari
Witold Pedrycz
Olivier Finkel
Walter A Kosters
John H Andreae
Sheila R M Veloso
Michio Sugeno
Andrew Adamatzky
Paul R Davidson
Abuzer Yakaryilmaz
A C Cem Say
Takeshi Okadome
Peter N Belhumeur
Eric Halgren
Yishay Mansour
Richard D Jones
J W Klop
Quentin F Stout
Hendrik Jan Hoogeboom
Peter D Neilson
Paper Map
More
Author Map (v2)
More
Mentorship Map
More
Mentorship Hierachical Map
More
Paper Recommendation