scientific article; zbMATH DE number 4126690
From MaRDI portal
Publication:4206394
Recommendations
- Autoreducibility of NP-complete sets
- scientific article; zbMATH DE number 3889514
- scientific article; zbMATH DE number 1759426
- Reducing the number of solutions of NP functions
- Autoreducibility of NP-complete sets under strong hypotheses
- scientific article; zbMATH DE number 915981
- Nonuniform reductions and NP-completeness
- Nonuniform reductions and NP-completeness
- Strong and weak reducibility of algorithmic problems
- A recursion-theoretic approach to NP
Cited in
(12)- Structural properties of bounded relations with an application to NP optimization problems
- Reducing the number of solutions of NP functions
- Using self-reducibilities to characterize polynomial time
- Automatic Evaluation of Reductions between NP-Complete Problems
- scientific article; zbMATH DE number 4092778 (Why is no real title available?)
- The Helping Hierarchy
- scientific article; zbMATH DE number 1759426 (Why is no real title available?)
- The consequences of eliminating NP solutions
- Fault-tolerance and complexity (extended abstract)
- The complexity of generating test instances
- A note on the self-witnessing property of computational problems
- On quasilinear-time complexity theory
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 Q4206394)
