P
NP-easy
computable
Cook reduction
algebraical
numerical analysis
NC
oracle machine
P-complete
NP-hard
Jacobian conjecture
recursive
RE
noncomputable
computability theory
busy beaver
superpolynomial
NP-complete
clockable
hyperjump
AAK theory
Schinzel's hypothesis H
decider
rational function
penalty function
Church-Turing thesis
formula
rule
boundary condition
rational root theorem
time complexity
Zeno machine
quantize
structure
simultaneous equations
transversality condition
Turing computable function
transfer function
Lax pair
polynomial time
coefficient
computable function
apodize
solvable
polynomially
complete
resolvable
halting problem
symmetric polynomial
universal Turing machine
Karp reduction
Pell number
finitizability
Turing jump
polytime
quartic function
Abel polynomial
Cramer's rule
turnpike
chakravala method
Legendre polynomial
cadlag
heuristic
algebraic variety
integral
kernelization
conjugate
transcendental function
irreducible
Horner's rule
algebraic
renewal theory
open
Tarski-Seidenberg theorem
relaxation
batch
Loschmidt's paradox
relaxation method
tractable
Buchberger's algorithm
discontinuous
recursive definition
Whittle likelihood
multigrid
Størmer's theorem
initial value problem
convergency
hypertask
recursive function
convergence
compactification
numericist
σ-finite measure
Lagrange's interpolation formula
approximant
Sendov's conjecture

English words for 'The set of all problems that are solvable in polynomial time by a deterministic Turing machine'

As you may have noticed, above you will find words for "The set of all problems that are solvable in polynomial time by a deterministic Turing machine". Hover the mouse over the word you'd like to know more about to view its definition. Click search related words by phrase or description. to find a better fitting word. Finally, thanks to ChatGPT, the overall results have been greatly improved.

Recent Queries