Phase transitions of subset sum and Shannon's limit in source coding

DOI10.1016/S0378-4371(03)00024-4MaRDI QIDQ1865459zbMATH OpenFDO

Authors Tomohiro Sasamoto

Publication date 26 March 2003

Published in Physica A (Search for Journal in Brave)

zbMATH Keywords

NP-complete problem

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Phase transitions (general) in equilibrium statistical mechanics (82B26)

Recommendations

• Statistical mechanics of an NP-complete problem: subset sum
• Phase Transition in the Number Partitioning Problem
• Statistical mechanics methods and phase transitions in optimization problems
• Phase transition and finite-size scaling in the vertex-cover problem
• Application of statistical mechanics to NP-complete problems in combinatorial optimisation

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1273988 (Why is no real title available?)
• Phase transitions and the search problem
• Probabilistic analysis of the number partitioning problem
• Statistical Physics of Spin Glasses and Information Processing
• Statistical mechanics of an NP-complete problem: subset sum

Cited in

(1)

• Statistical mechanics of an NP-complete problem: subset sum

This page was built for publication: Phase transitions of subset sum and Shannon's limit in source coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865459)