scientific article; zbMATH DE number 4120160

zbMATH Open0684.03017MaRDI QIDQ4733859FDOQ4733859

Larry J. Stockmeyer

Publication date: 1989

Title of this publication is not available (Why is that?)

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)

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

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)