Pages that link to "Item:Q1351162"
From MaRDI portal
The following pages link to Functions computable with limited access to NP (Q1351162):
Displaying 8 items.
- The consequences of eliminating NP solutions (Q458458) (← links)
- A hierarchy based on output multiplicity (Q1274991) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- Functions computable with nonadaptive queries to NP (Q1384712) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- Restricted information from nonadaptive queries to NP (Q1923107) (← links)
- Does the polynomial hierarchy collapse if onto functions are invertible? (Q2268347) (← links)
- Resource-bounded kolmogorov complexity revisited (Q5047163) (← links)