The join can lower complexity
From MaRDI portal
Recommendations
Cites work
- A low and a high hierarchy within NP
- Computing solutions uniquely collapses the polynomial hierarchy
- Graph isomorphism is in the low hierarchy
- Locating P/poly optimally in the extended low hierarchy
- Lower bounds for the low hierarchy
- On Circuit-Size Complexity and the Low Hierarchy in NP
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
- Probabilistic complexity classes and lowness
- Separating the low and high hierarchies by oracles
- Sparse Sets, Lowness and Highness
- The Extended Low Hierarchy is an Infinite Hierarchy
- The polynomial-time hierarchy
This page was built for publication: The join can lower complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184670)