Pages that link to "Item:Q1374784"
From MaRDI portal
The following pages link to Easy sets and hard certificate schemes (Q1374784):
Displaying 12 items.
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Inverting onto functions. (Q1426007) (← links)
- Characterizing the existence of one-way permutations (Q1575721) (← links)
- On characterizing the existence of partial one-way permutations (Q1603545) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- Recursion-theoretic ranking and compression (Q1713478) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- One-way permutations and self-witnessing languages (Q1877694) (← links)
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- The opacity of backbones (Q2051797) (← links)
- A Downward Collapse within the Polynomial Hierarchy (Q4210153) (← links)
- Immunity and Simplicity for Exact Counting and Other Counting Classes (Q4265536) (← links)