Reducing the complexity of reductions
From MaRDI portal
Publication:5957724
Recommendations
Cited in
(22)- scientific article; zbMATH DE number 1559593 (Why is no real title available?)
- Lazy narrowing with simplification
- Reducing sequences
- The Complexity of Complexity
- Comparing reductions to NP-complete sets
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Local reduction
- Non-uniform reductions
- A reduction algorithm meeting users' requirements.
- Reductivity
- Rudimentary reductions revisited
- Strong Reductions and Isomorphism of Complete Sets
- scientific article; zbMATH DE number 7528580 (Why is no real title available?)
- scientific article; zbMATH DE number 7650112 (Why is no real title available?)
- DNF sparsification and a faster deterministic counting algorithm
- Investigations concerning the structure of complete sets
- scientific article; zbMATH DE number 1222831 (Why is no real title available?)
- Local restrictions from the Furst-Saxe-Sipser paper
- Finding Reductions Automatically
- The isomorphism conjecture for constant depth reductions
- Nonuniform reductions and NP-completeness
- Local reductions
This page was built for publication: Reducing the complexity of reductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957724)