The following pages link to (Q4140381):
Displayed 6 items.
- The complexity of computing the permanent (Q600247) (← links)
- A note on \(\#\mathcal P\)-completeness of NP-witnessing relations (Q976088) (← links)
- Structure preserving reductions among convex optimization problems (Q1143173) (← links)
- Toward a unified approach for the classification of NP-complete optimization problems (Q1143789) (← links)
- The isomorphism conjecture holds and one-way functions exist relative to an oracle (Q1362333) (← links)
- Inclusion complete tally languages and the Hartmanis-Berman conjecture (Q4140380) (← links)