The following pages link to (Q3161327):
Displaying 4 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- An introduction to multi-parameter complexity analysis of discrete problems (Q1772842) (← links)
- An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103) (← links)