Sparse sets versus complexity classes
From MaRDI portal
Recommendations
- Sparse sets and collapse of complexity classes
- scientific article; zbMATH DE number 3984573
- Complexity classes and sparse oracles
- A note on sparse sets and the polynomial-time hierarchy
- Sparse Sets in : Relativizations
- On Sparse Complete Sets
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- Hardness of sparse sets and minimal circuit size problem
- On sparse hard sets for counting classes
Cited in
(9)- A note on sparse sets and the polynomial-time hierarchy
- Resolution of Hartmanis' conjecture for NL-hard sparse sets
- On sparseness, reducibilities, and complexity
- Complexity classes and sparse oracles
- On membership comparable sets
- Sparse sets, approximable sets, and parallel queries to NP
- Sparse and Lopsided Set Disjointness via Information Theory
- scientific article; zbMATH DE number 1008513 (Why is no real title available?)
- Sparse NP-complete problems over the reals with addition
This page was built for publication: Sparse sets versus complexity classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359456)
