Statistical mechanics of an NP-complete problem: subset sum

DOI10.1088/0305-4470/34/44/314zbMath1017.68060arXivcond-mat/0106125OpenAlexW2104846280MaRDI QIDQ4533606

Hidetoshi Nishimori, Tomohiro Sasamoto, Taro Toyoizumi

Publication date: 11 June 2002

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0106125

zbMATH Keywords

NP-complete problemnumber partitioning problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Equilibrium statistical mechanics (82B99)

Related Items (3)

Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach ⋮ Proof of the local REM conjecture for number partitioning. I: Constant energy scales ⋮ Phase transitions of subset sum and Shannon's limit in source coding

This page was built for publication: Statistical mechanics of an NP-complete problem: subset sum