Publication:4218136

zbMath0912.03022MaRDI QIDQ4218136

Juraj Wiedermann

Publication date: 2 March 1999

zbMATH Keywords

separation; complexity classes; speed-up; nondeterministic Turing machine

Mathematics Subject Classification ID

03D15: Complexity of computation (including implicit computational complexity)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03D10: Turing machines and related notions

Related Items

Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences