Pages that link to "Item:Q3314997"
From MaRDI portal
The following pages link to Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets (Q3314997):
Displaying 14 items.
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- Some consequences of non-uniform conditions on uniform classes (Q794427) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- On polynomial-time Turing and many-one completeness in PSPACE (Q1193869) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Quasi-linear truth-table reductions to \(p\)-selective sets (Q1351469) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- (Q4256649) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- (Q4814348) (← links)
- On the power of parity polynomial time (Q5096157) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
