Pages that link to "Item:Q1068536"
From MaRDI portal
The following pages link to On one-one polynomial time equivalence relations (Q1068536):
Displaying 15 items.
- Local restrictions from the Furst-Saxe-Sipser paper (Q519884) (← links)
- On the p-isomorphism conjecture (Q758202) (← links)
- A comparison of polynomial time completeness notions (Q1097692) (← links)
- On one-way functions and polynomial-time isomorphisms (Q1097694) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- Collapsing degrees (Q1109766) (← links)
- Notes on polynomial levelability (Q1119389) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- Exponential-time and subexponential-time sets (Q1261474) (← links)
- One-way functions and the isomorphism conjecture (Q1329733) (← links)
- On resource-bounded instance complexity (Q1351945) (← links)
- DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization (Q1362330) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- One-way functions and the nonisomorphism of NP-complete sets (Q2639055) (← links)
- Complete problems and strong polynomial reducibilities (Q5096158) (← links)