Pages that link to "Item:Q1158970"
From MaRDI portal
The following pages link to General approximation algorithms for some arithmetical combinatorial problems (Q1158970):
Displaying 4 items.
- ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
- The Complexity of Contracts (Q5856150) (← links)
