Pages that link to "Item:Q1077412"
From MaRDI portal
The following pages link to Reductions among polynomial isomorphism types (Q1077412):
Displaying 17 items.
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- On the p-isomorphism conjecture (Q758202) (← links)
- Padding, commitment and self-reducibility (Q808694) (← links)
- New developments in structural complexity theory (Q913509) (← links)
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP (Q1079364) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- Collapsing degrees (Q1109766) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- On p-creative sets and p-completely creative sets (Q1183565) (← links)
- Polynomial-time compression (Q1198955) (← links)
- Scalability and the isomorphism problem (Q1351582) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- Query-monotonic Turing reductions (Q2383592) (← links)
- One-way functions and the nonisomorphism of NP-complete sets (Q2639055) (← links)
- A survey of one-way functions in complexity theory (Q4009812) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Productive functions and isomorphisms (Q4327382) (← links)
