Strong Reductions and Isomorphism of Complete Sets
From MaRDI portal
Publication:5458832
Recommendations
Cites work
- scientific article; zbMATH DE number 5819433 (Why is no real title available?)
- scientific article; zbMATH DE number 2081095 (Why is no real title available?)
- scientific article; zbMATH DE number 1860651 (Why is no real title available?)
- A First-Order Isomorphism Theorem
- Almost everywhere high nonuniform complexity
- Comparing reductions to NP-complete sets
- Isomorphisms and 1-L reductions
- On Isomorphisms and Density of $NP$ and Other Complete Sets
- Reducing the complexity of reductions
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- Resource bounded randomness and weakly complete problems
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
Cited in
(5)
This page was built for publication: Strong Reductions and Isomorphism of Complete Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458832)