Pages that link to "Item:Q4379728"
From MaRDI portal
The following pages link to Exponentially small bounds on the expected optimum of the partition and subset sum problems (Q4379728):
Displaying 6 items.
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Phase transition and finite-size scaling for the integer partitioning problem (Q2772921) (← links)
- Proof of the local REM conjecture for number partitioning. II. Growing energy scales (Q3619614) (← links)
- A Logarithmic Bound for Solving Subset Sum with P Systems (Q5452061) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)
- A physicist's approach to number partitioning (Q5958802) (← links)
