Why are we using polynomial time reductions in completeness for classes over polynomial hierarchy?

For classes over NP (EXPTIME, EXPSPACE etc.) we define complete problems in terms of polynomial time reductions. I can understand that it is useful in cases of that class being equal to P, but it...

18 September 2013 7,454 2 View