The following pages link to Marco Cesati (Q290267):
Displaying 7 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Perfect Code is \(W[1]\)-complete (Q1603518) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- MemShield: GPU-assisted software memory encryption (Q2229416) (← links)
- Sparse parameterized problems (Q2564046) (← links)
- (Q4251980) (← links)
- Computation Models for Parameterized Complexity (Q4336699) (← links)
