Shiner–Davison–Landsberg complexity revisited

DOI10.1088/1742-5468/2005/11/P11009MaRDI QIDQ4968819zbMATH OpenOpenAlexFDO

Authors Ruedi Stoop, A. Kern, Willi-Hans Steeb, N. Stoop

Publication date 9 July 2019

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1742-5468/2005/11/p11009

zbMATH Keywords

classical phase transitions (theory)exact resultsfluctuations (theory)new applications of statistical mechanics

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Recommendations

• Sharp threshold results for computational complexity
• A refinement of Cauchy-Schwarz complexity
• Resource-bounded Kolmogorov complexity revisited
• Resource-bounded Kolmogorov complexity revisited
• scientific article; zbMATH DE number 1670593
• Mathematical Foundations of Computer Science 2005
• The complexity of satisfiability problems: Refining Schaefer's theorem
• scientific article; zbMATH DE number 3917710
• Measures of -complexity
• Complexity of generalized Rudin-Shapiro sequences

Cites work

• A comparative classification of complexity measures
• A Mathematical Theory of Communication
• Complexity of dynamics as variability of predictability
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 3232730 (Why is no real title available?)
• On the Complexity of Finite Sequences
• On the Length of Programs for Computing Finite Binary Sequences
• Toward a quantitative theory of self-generated complexity

Cited in

(3)

• A comparison of LMC and SDL complexity measures on binomial distributions
• Comment on the Shiner-Davison-Landsberg measure
• Net Fisher information measure versus ionization potential and dipole polarizability in atoms

This page was built for publication: Shiner–Davison–Landsberg complexity revisited

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