The following pages link to Complexity for type-2 relations (Q922532):
Displaying 8 items.
- The relative complexity of NP search problems (Q1273858) (← links)
- A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
- Polynomial games and determinacy (Q1919550) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- Analytical properties of resource-bounded real functionals (Q2509953) (← links)
- Structural properties for feasibly computable classes of type two (Q4009811) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\) (Q6560166) (← links)
