Sharp threshold and scaling window for the integer partitioning problem
From MaRDI portal
Publication:5175987
DOI10.1145/380752.380854zbMath1323.68311OpenAlexW2123980360MaRDI QIDQ5175987
Boris G. Pittel, Christian Borgs, Jennifer T. Chayes
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380854
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of partitions of integers (05A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Lattice-based algorithms for number partitioning in the hard phase, Phase transition and finite-size scaling for the integer partitioning problem, Phase diagram for the constrained integer partitioning problem
Cites Work