Padding, commitment and self-reducibility
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3845080 (Why is no real title available?)
- scientific article; zbMATH DE number 4022646 (Why is no real title available?)
- scientific article; zbMATH DE number 3594673 (Why is no real title available?)
- A Note on Sparse Complete Sets
- Natural Self-Reducible Sets
- On Isomorphisms and Density of $NP$ and Other Complete Sets
- On helping by robust oracle machines
- On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- Reductions among polynomial isomorphism types
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
Cited in
(4)
This page was built for publication: Padding, commitment and self-reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808694)