Pages that link to "Item:Q3979608"
From MaRDI portal
The following pages link to Completeness for nondeterministic complexity classes (Q3979608):
Displaying 21 items.
- Dichotomy theorems for families of non-cofinal essential complexity (Q329489) (← links)
- Observations on complete sets between linear time and polynomial time (Q627129) (← links)
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- A comparison of polynomial time completeness notions (Q1097692) (← links)
- Almost-everywhere complexity hierarchies for nondeterministic time (Q1261465) (← links)
- Exponential-time and subexponential-time sets (Q1261474) (← links)
- The relative power of logspace and polynomial time reductions (Q1312179) (← links)
- Non-uniform reductions (Q1959376) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- Partial bi-immunity, scaled dimension, and NP-completeness (Q2480744) (← links)
- Mirror images and schemes for the maximal complexity of nondeterminism (Q2893313) (← links)
- Introduction to Autoreducibility and Mitoticity (Q2973718) (← links)
- (Q3746888) (← links)
- (Q3779737) (← links)
- (Q3817611) (← links)
- Circuit Definitions of Nondeterministic Complexity Classes (Q4016401) (← links)
- (Q4501542) (← links)
- \(\beta_k\)-complete problems and greediness (Q4529625) (← links)
- Computing and Combinatorics (Q5716924) (← links)