The following pages link to (Q4733404):
Displaying 11 items.
- Nontriviality for exponential time w.r.t. weak reducibilities (Q391074) (← links)
- Strong polynomial-time reducibility (Q676314) (← links)
- Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) (← links)
- Strong nondeterministic Turing reduction - a technique for proving intractability (Q1262762) (← links)
- (Q3032239) (← links)
- Nontriviality for Exponential Time w.r.t. Weak Reducibilities (Q3569066) (← links)
- A second step toward the strong polynomial-time hierarchy (Q3816982) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- On Nondeterminism, Enumeration Reducibility and Polynomial Bounds (Q4351919) (← links)
- Strong extension axioms and Shelah's zero-one law for choiceless polynomial time (Q4457727) (← links)
- Strong co-nondeterministic lower bounds for NP cannot be proved feasibly (Q6086996) (← links)
