Pages that link to "Item:Q1816724"
From MaRDI portal
The following pages link to Polynomial-time isomorphism of 1-L-complete sets (Q1816724):
Displaying 8 items.
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- Reductions among polynomial isomorphism types (Q1077412) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- Scalability and the isomorphism problem (Q1351582) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Investigations Concerning the Structure of Complete Sets (Q2821693) (← links)
- Reducing the complexity of reductions (Q5957724) (← links)