Pages that link to "Item:Q3210177"
From MaRDI portal
The following pages link to On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177):
Displaying 28 items.
- NP-hard sets are superterse unless NP is small (Q290182) (← links)
- Reducibility classes of P-selective sets (Q672155) (← links)
- Some results on selectivity and self-reducibility (Q672402) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- On sets Turing reducible to p-selective sets (Q675861) (← links)
- On symmetric differences of NP-hard sets with weakly P-selective sets (Q1314375) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- Quasi-linear truth-table reductions to \(p\)-selective sets (Q1351469) (← links)
- Query complexity of membership comparable sets. (Q1401341) (← links)
- Some structural properties of SAT (Q1587336) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- \(p\)-Selective sets and reducing search to decision vs. self-reducibility (Q1816728) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- Approximable sets (Q1898468) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Adaptive versus nonadaptive queries to NP and P-selective sets (Q1961059) (← links)
- On membership comparable sets (Q1961377) (← links)
- Robustness of PSPACE-complete sets (Q2379952) (← links)
- The complexity of finding top-Toda-equivalence-class members (Q2509036) (← links)
- One query reducibilities between partial information classes (Q2575741) (← links)
- Structural analysis of the complexity of inverse functions (Q4032932) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- (Q4814348) (← links)
- On sets bounded truth-table reducible to P-selective sets (Q4942650) (← links)
- LATIN 2004: Theoretical Informatics (Q5901629) (← links)
- Counting classes: Thresholds, parity, mods, and fewness (Q5905584) (← links)
