Sharp threshold and scaling window for the integer partitioning problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 330-336

  Borgs, C ^a   Chayes, J T ^a   Pittel, B ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY; INTEGER PROGRAMMING; PARAMETER ESTIMATION; PHASE TRANSITIONS; POISSON DISTRIBUTION; PROBABILITY; PROBLEM SOLVING; THRESHOLD LOGIC;

INTEGER PARTITIONING PROBLEM;

COMBINATORIAL MATHEMATICS;

EID: 0034837074     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380854     Document Type: Conference Paper

References (22)

1. On sums of subsets of a set of integers
2. The evolution of random graphs
3. The scaling window of the 2-sat transition
4. A rigorous theory of finite-size scaling at first-order transitions
5. Solving dense subset-sum problems by using analytical number theory
6. Random-energy model: An exactly solvable model of disordered systems
7. On the evolution of random graphs
8. On the evolution of random graphs
9. Probabilistic analysis of the number partitioning problem
10. Statistical mechanics analysis of the continuous number partitioning problem
11. An analytical method of analysis of linear boolean equations
12. Sharp thresholds of graph properties, and the k-sat problem
13. The use and abuse of statistical mechanics in computational complexity
14. The birth of the giant component
15. Probabilistic analysis of optimum partitioning
16. Component behavior near the critical point of the random graph process
17. Exponentially small bounds on the expected optimum of the partition and subset sum problem
18. Phase transition in the number partitioning problem
19. Random costs in combinatorial optimization