The isomorphism conjecture for NP
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4154424
- On the NP-isomorphism problem with respect to random instances
- Relativized isomorphisms of NP-complete sets
- On the p-isomorphism conjecture
- The computational complexity of equivalence and isomorphism problems
- The isomorphism conjecture for constant depth reductions
- scientific article; zbMATH DE number 1256638
- The Isomorphism Conjecture Holds Relative to an Oracle
- scientific article; zbMATH DE number 1302479
- scientific article; zbMATH DE number 88948
Cited in
(16)- scientific article; zbMATH DE number 1860651 (Why is no real title available?)
- On one-one polynomial time equivalence relations
- scientific article; zbMATH DE number 4154424 (Why is no real title available?)
- A candidate counterexample to the easy cylinders conjecture
- The isomorphism conjecture fails relative to a random oracle
- scientific article; zbMATH DE number 88948 (Why is no real title available?)
- The Isomorphism Conjecture Holds Relative to an Oracle
- On one-way functions and polynomial-time isomorphisms
- On a class of isomorphic NFSRs
- One-way functions and the isomorphism conjecture
- Reducing the complexity of reductions
- One-way functions and the nonisomorphism of NP-complete sets
- Space-time isomorphism problem is intractable (NP-hard)
- Local restrictions from the Furst-Saxe-Sipser paper
- The isomorphism conjecture for constant depth reductions
- Relativized isomorphisms of NP-complete sets
This page was built for publication: The isomorphism conjecture for NP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906562)
