Pages that link to "Item:Q3107360"
From MaRDI portal
The following pages link to Strong isomorphism reductions in complexity theory (Q3107360):
Displaying 10 items.
- Strong polynomial-time reducibility (Q676314) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- On the isomorphism conjecture for weak reducibilities (Q1816734) (← links)
- Barendregt's problem \#26 and combinatory strong reduction (Q2104281) (← links)
- Graphs realised by r.e. equivalence relations (Q2349100) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY (Q2933680) (← links)
- (Q4036580) (← links)
- On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite p-groups (Q4983072) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)