scientific article; zbMATH DE number 512801
From MaRDI portal
Publication:4281494
zbMath0788.68049MaRDI QIDQ4281494
Edith Hemaspaandra, Leen Torenvliet, Harry Buhrman
Publication date: 10 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
completenessexponential timeseparation of complexity classesbounded reductionsnondeterministic time classes
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
On P-immunity of exponential time complete sets ⋮ Non-uniform reductions ⋮ Relations between average-case and worst-case complexity ⋮ Optimal series-parallel trade-offs for reducing a function to its own graph
This page was built for publication:
