NP-hard
NP-complete
P
computable
NP-easy
Cook reduction
P-complete
Pell's equation
diazoamino compound
Schinzel's hypothesis H
oxyimino
hyperjump
solvable
Cauchy problem
resolvable
Jacobian conjecture
irresoluble
intractable
cannonball problem
open problem
factorise
factorize
Abel polynomial
solvability
fencepost problem
rational root theorem
computability theory
imitation game
selenenic acid
insolubility
diazene
rule
root extraction
unsolvability
penalty function
formula
algebraic number
runtime error
Turing degree
sulfenylium
AI-complete
semantic error
run-time error
polynomially
imino
kink
initial value problem
diazenyl
Sendov's conjecture
quadratic function
Fermat's little theorem
tessarine
Wick rotation
Loschmidt's paradox
complete
unsolvably
Fuglede's conjecture
Markov number
Gauss-Lucas theorem
semibent
transversality condition
Turing computable function
hyperbolic polynomial
NC
Dickson's conjecture
time complexity
mystifier
unriddle
hyperring
p-adic absolute value
operational calculus
solving
Siegel zero
operational analysis
unresolvable
Schur function
puzzle
resolution
teaser
insolvable
unsolvable
puzzler
Horner's rule
unsoluble
uniformly continuous
Sylvester equation
problemed
Laguerre polynomial
puzzle over
sulfonimidamide
Durand-Kerner method
Nevanlinna theory
heuristic
unmanageable
uncontrollable
pole
Abel sum
positone

English words for 'A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H.'

As you may have noticed, above you will find words for "A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H.". 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