Pages that link to "Item:Q4857595"
From MaRDI portal
The following pages link to Polynomial-Time Membership Comparable Sets (Q4857595):
Displaying 21 items.
- NP-hard sets are superterse unless NP is small (Q290182) (← links)
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- Reducibility classes of P-selective sets (Q672155) (← links)
- Some results on selectivity and self-reducibility (Q672402) (← links)
- P-selectivity: Intersections and indices (Q673115) (← links)
- On the size of classes with weak membership properties (Q1274925) (← links)
- Boolean operations, joins, and the extended low hierarchy (Q1275091) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- Quasi-linear truth-table reductions to \(p\)-selective sets (Q1351469) (← links)
- Time bounded frequency computations (Q1383147) (← links)
- Query complexity of membership comparable sets. (Q1401341) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Some structural properties of SAT (Q1587336) (← links)
- Sparse selfreducible sets and nonuniform lower bounds (Q1755786) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- Commutative queries (Q1854422) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- One query reducibilities between partial information classes (Q2575741) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
