NP-complete
NP-hard
NP-easy
Cook reduction
P
computable
tractable
superpolynomial
convergent
hyperjump
Turing computable function
heuristic
Horner's rule
polynomial time
superrecursive
polynomial
sublogarithmic
algebraizable
computable function
superoptimizer
isogeny
polynomially
trimagic
algorithmicize
time complexity
Collatz conjecture
clockable
semibent
reduction
autoreducible
root extraction
Karatsuba algorithm
approximand
Karp reduction
Zeno machine
linear time
subquadratic
Narayana number
Blum integer
polynomial form
quadratic form
quantize
superstabilizing
trapdoor function
Church-Turing thesis
undecidable
algebraical
algoristic
scruffy
algorithmizable
Turing complete
cyclotomic polynomial
Abel sum
hyponormal
bimagic
semi-algorithm
Hermite polynomial
synthetic division
bignum
polynomialist
polytime
Gale-Shapley algorithm
semiartinian
supersampler
recursive
Appell sequence
tilting
tetramagic
nilpotent
conjugate
arbitrary-precision arithmetic
NC
Touchard polynomial
divisibility sequence
linearizability
irreducible
radius of convergence
algorithmicization
coefficient
random number generator
determinize
neuroalgorithmic
Real Programmer
Turing
decidable
headroom
guessingly
linearithmic
Schinzel's hypothesis H
quadratic residue
multimagic
polynomiality
block cipher
diddle
Schönhage-Strassen algorithm
nonalgorithmic
bihermitian
base case
unalgorithmic