Pages that link to "Item:Q1329162"
From MaRDI portal
The following pages link to On reductions of NP sets to sparse sets (Q1329162):
Displaying 19 items.
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets (Q1276171) (← links)
- On resource-bounded instance complexity (Q1351945) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- Approximable sets (Q1898468) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- Learning Reductions to Sparse Sets (Q2849914) (← links)
- (Q3811710) (← links)
- (Q4256649) (← links)
- (Q4373559) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- On sparseness and Turing reducibility over the reals (Q4916198) (← links)
- On sets bounded truth-table reducible to P-selective sets (Q4942650) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
- The complexity of grid coloring (Q6109067) (← links)