Pages that link to "Item:Q456697"
From MaRDI portal
The following pages link to Parameterized complexity and approximability of the longest compatible sequence problem (Q456697):
Displaying 4 items.
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
