scientific article; zbMATH DE number 3988707

From MaRDI portal
Publication:3751005





[For the entire collection see Zbl 0591.00015.] 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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751005)