Pages that link to "Item:Q1097694"
From MaRDI portal
The following pages link to On one-way functions and polynomial-time isomorphisms (Q1097694):
Displaying 16 items.
- Relativized isomorphisms of NP-complete sets (Q687510) (← links)
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- Collapsing degrees (Q1109766) (← 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)
- DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization (Q1362330) (← links)
- The isomorphism conjecture holds and one-way functions exist relative to an oracle (Q1362333) (← links)
- On P-immunity of exponential time complete sets (Q1362336) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality (Q2182332) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Complete problems and strong polynomial reducibilities (Q5096158) (← links)
