Pages that link to "Item:Q1061119"
From MaRDI portal
The following pages link to Qualitative relativizations of complexity classes (Q1061119):
Displaying 14 items.
- The strong exponential hierarchy collapses (Q584250) (← links)
- Optimal advice (Q672755) (← links)
- Robust machines accept easy sets (Q914369) (← links)
- A comparison of polynomial time completeness notions (Q1097692) (← links)
- Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- Positive relativizations for log space computability (Q2639638) (← links)
- Cluster computing and the power of edge recognition (Q2643084) (← links)
- Characterizing polynomial complexity classes by reducibilities (Q3489449) (← links)
- RelativizedNC (Q3763591) (← links)
- On relativizations with restricted number of accesses to the oracle set (Q3779739) (← links)
- SELF-SPECIFYING MACHINES (Q5249003) (← links)
- ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES (Q5704373) (← links)
