The following pages link to (Q4279511):
Displaying 24 items.
- Advice classes of parametrized tractability (Q676315) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
- Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
- Parameterized random complexity (Q1946497) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- Crypto Galore! (Q2908530) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Parameterized Learnability of k-Juntas and Related Problems (Q3520054) (← links)
- Complexity Measures for Public-Key Cryptosystems (Q3787917) (← links)
- (Q4737241) (← links)
- (Q5150410) (← links)
- On the Cryptographic Complexity of the Worst Functions (Q5746343) (← links)
- A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum (Q6045460) (← links)
- On the computational hardness of the code equivalence problem in cryptography (Q6112221) (← links)
- On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan (Q6535285) (← links)
