On the existence of hard sparse sets under weak reductions
From MaRDI portal
Publication:4593941
Recommendations
Cited in
(16)- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds
- On random reductions from sparse sets to tally sets
- On symmetric differences of NP-hard sets with weakly P-selective sets
- scientific article; zbMATH DE number 1834655 (Why is no real title available?)
- On the sparse set conjecture for sets with low density
- Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets
- Sparse sets, approximable sets, and parallel queries to NP
- Sparse selfreducible sets and nonuniform lower bounds
- On sparse hard sets for counting classes
- On the construction of a family of transversal subspaces over finite fields
- scientific article; zbMATH DE number 4100610 (Why is no real title available?)
- scientific article; zbMATH DE number 1332663 (Why is no real title available?)
- On membership comparable sets
- There are no sparse NP\(_{w}\)-hard sets
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis
- Resolution of Hartmanis' conjecture for NL-hard sparse sets
This page was built for publication: On the existence of hard sparse sets under weak reductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593941)