scientific article; zbMATH DE number 4120160

MaRDI QIDQ4733859zbMATHFDO

Authors Larry J. Stockmeyer

Publication date 1989

zbMATH Keywords

surveycomputational complexitylower boundscompletenessbibliographyreducibilitiesdecidable sets

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15)

Cited in

(3)

• Computational complexity of problems in classification according to a relation matrix
• Separating Complexity Classes Using Autoreducibility
• Classification and complexity of problems.

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 Q4733859)