Pages that link to "Item:Q608273"
From MaRDI portal
The following pages link to A generic approach to proving NP-hardness of partition type problems (Q608273):
Displaying 8 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- On domain-partitioning induction criteria: worst-case bounds for the worst-case based (Q1885908) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- The Complexity of Contracts (Q5856150) (← links)
- No existence of a linear algorithm for the one-dimensional Fourier phase retrieval (Q6649702) (← links)
- Almost periodic functions: their limit sets and various applications (Q6649836) (← links)