The following pages link to Collapsing degrees (Q1109766):
Displaying 9 items.
- Relativized isomorphisms of NP-complete sets (Q687510) (← links)
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- On p-creative sets and p-completely creative sets (Q1183565) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- On 1-truth-table-hard languages (Q1261477) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- One-way functions and the isomorphism conjecture (Q1329733) (← links)
- Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)
