Sparse sets and reducibilities with nonpolynomial bound.

Abstract

This thesis investigates relations between complexity classes, resource bounded reducibilities and different kinds of sets (mainly sparse and padded sets). We took some results from where polynomials occur in different ways and discovered what happens if polynomials are replaced by another class of functions. The results in the thesis can be divided into three groups: 1. We studied complete problems with respect to reducibilities not only polynomially bounded. We proved that reducibilities are the best for a given nondeterministic complexity class. 2. We studied upward separation techniques.The main results include the solution of an open question of Hartmanis. We also obtained other new upward separation results. 3. We compared the power of polynomial time reducibilities to a special kind of sets called padded.Available from STL Prague, CZ / NTK - National Technical LibrarySIGLECZCzech Republi