Complexity-class-encoding sets
From MaRDI portal
Publication:1237360
Cites work
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A comparison of polynomial time reducibilities
- An Overview of the Theory of Computational Complexity
- Classes of computable functions defined by bounds on computation
- On Reducibility to Complex or Sparse Sets
- On Sets Cook-Reducible to Sparse Sets
- The complexity of theorem-proving procedures
This page was built for publication: Complexity-class-encoding sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1237360)