Pages that link to "Item:Q1191028"
From MaRDI portal
The following pages link to On polynomial time one-truth-table reducibility to a sparse set (Q1191028):
Displaying 8 items.
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- On 1-truth-table-hard languages (Q1261477) (← links)
- On reductions of NP sets to sparse sets (Q1329162) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- On characterizing the existence of partial one-way permutations (Q1603545) (← links)
- Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Q3978778) (← links)
- (Q4256649) (← links)