Using the renormalization group to classify Boolean functions

DOI10.1007/S10955-008-9486-2MaRDI QIDQ2482277zbMATH OpenOpenAlexWikidataFDO

Authors S. N. Coppersmith

Publication date 16 April 2008

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10955-008-9486-2

zbMATH Keywords

computational complexityrenormalization group

Mathematics Subject Classification ID

Phase transitions (general) in equilibrium statistical mechanics (82B26) Renormalization group methods in equilibrium statistical mechanics (82B28)

Recommendations

• scientific article; zbMATH DE number 176868
• Energy and criticality in random Boolean networks
• Harmonic analysis and Boolean function complexity
• scientific article; zbMATH DE number 5022109
• Nested canalyzing, unate cascade, and polynomial functions

Cites work

• scientific article; zbMATH DE number 5604094 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 4093436 (Why is no real title available?)
• scientific article; zbMATH DE number 124716 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1142303 (Why is no real title available?)
• scientific article; zbMATH DE number 1161568 (Why is no real title available?)
• A New Derivation of Stirling's Approximation to n!
• Boolean dynamics with random couplings
• Closing probabilities in the Kauffman model: An annealed computation
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
• Natural proofs
• Numerical and theoretical studies of noise effects in the Kauffman model
• Parity, circuits, and the polynomial-time hierarchy
• Random-energy model: an exactly solvable model of disordered systems
• Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
• Relevant elements, magnetization and dynamical properties in Kauffman networks: A numerical study
• Renormalization group and critical phenomena. I: Renormalization group and the Kadanoff scaling picture
• Reversible Boolean networks. I: Distribution of cycle lengths
• The Power and Weakness of Randomness in Computation
• The complexity of theorem-proving procedures

This page was built for publication: Using the renormalization group to classify Boolean functions

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