Login / Signup
A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Determinsitic Turing Machines with Primitive Pecursove Tape or Time Bounds.
Hagen Huwig
Published in:
MFCS (1976)
Keyphrases
</>
turing machine
worst case
tractable cases
high level
complexity measures
upper bound
computational cost
high speed
upper and lower bounds
average case
learning algorithm
computational complexity
support vector machine
data exchange
learning machines
error tolerance