Pages that link to "Item:Q1191028"

The following pages link to On polynomial time one-truth-table reducibility to a sparse set (Q1191028):

Displaying 2 items.

• Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
• On characterizing the existence of partial one-way permutations (Q1603545) (← links)