Pages that link to "Item:Q1346700"
From MaRDI portal
The following pages link to A polynomial approximation scheme for the subset sum problem (Q1346700):
Displaying 9 items.
- Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- Master-slave strategy and polynomial approximation (Q1588828) (← links)
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965) (← links)
- Dynamic programming for the subset sum problem (Q2658814) (← links)
- Techniques for solving subset sum problems within a given tolerance (Q3410169) (← links)
- (Q3985788) (← links)
- A Logarithmic Bound for Solving Subset Sum with P Systems (Q5452061) (← links)
- An exact algorithm for the subset sum problem (Q5955091) (← links)