Abstract
In the present paper an overview is presented of diagonalisation methods which have been used for the construction of oracle sets relative to which complexity classes in the P-Time Hierarchy are separated structurally. A comparison of the methods is made on the basis of inherent properties. A characterisation of these properties leads to a first attempt for a taxonomy for these diagonalisation methods.
Cite
CITATION STYLE
Torenvliet, L., & van Emde Boas, P. (1986). Diagonalisation methods in a polynomial setting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 223 LNCS, pp. 330–346). Springer Verlag. https://doi.org/10.1007/3-540-16486-3_109
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
