Pages that link to "Item:Q1120564"
From MaRDI portal
The following pages link to Nondeterministic bounded query reducibilities (Q1120564):
Displaying 9 items.
- On adaptive versus nonadaptive bounded query machines (Q808242) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- On the computational complexity of querying bounds on differences constraints (Q1855216) (← links)
- On the structures inside truth-table degrees (Q2747717) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Weakly semirecursive sets (Q3480024) (← links)
- On Bounded Queries and Approximation (Q4337440) (← links)
- (Q4938554) (← links)
- (Q4945240) (← links)