Pages that link to "Item:Q1149766"
From MaRDI portal
The following pages link to On gamma-reducibility versus polynomial time many-one reducibility (Q1149766):
Displaying 6 items.
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446) (← links)
- Strong nondeterministic polynomial-time reducibilities (Q1055405) (← links)
- One-way functions and circuit complexity (Q1096587) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
