Skip to content

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

VenueBMFCS
Year1976
ProceedingsMFCS

Browse the full MFCS paper archive.