Pages that link to "Item:Q1351469"
From MaRDI portal
The following pages link to Quasi-linear truth-table reductions to \(p\)-selective sets (Q1351469):
Displaying 13 items.
- Frequency computation and bounded queries (Q671360) (← links)
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913) (← links)
- Query complexity of membership comparable sets. (Q1401341) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← 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)
- PP is closed under truth-table reductions (Q1908349) (← links)
- Adaptive versus nonadaptive queries to NP and P-selective sets (Q1961059) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- On sets bounded truth-table reducible to P-selective sets (Q4942650) (← links)