Pages that link to "Item:Q3519395"
From MaRDI portal
The following pages link to An Isomorphism Between Subexponential and Parameterized Complexity Theory (Q3519395):
Displaying 10 items.
- Confronting intractability via parameters (Q465686) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Parameterized random complexity (Q1946497) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)