First Page | Document Content | |
---|---|---|
Date: 2013-11-01 17:11:36Computational complexity theory Theory of computation Complexity classes Strong NP-completeness Polynomial-time approximation scheme Bin Packing problems NP-complete problems Bin packing problem | Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010Add to Reading ListSource URL: www.math.washington.eduDownload Document from Source WebsiteFile Size: 430,96 KBShare Document on Facebook |