Using the renormalization group to classify Boolean functions
From MaRDI portal
Publication:2482277
DOI10.1007/S10955-008-9486-2zbMATH Open1214.82037OpenAlexW2084359427WikidataQ59449317 ScholiaQ59449317MaRDI QIDQ2482277FDOQ2482277
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
Recommendations
Phase transitions (general) in equilibrium statistical mechanics (82B26) Renormalization group methods in equilibrium statistical mechanics (82B28)
Cites Work
- Title not available (Why is that?)
- Renormalization group and critical phenomena. I: Renormalization group and the Kadanoff scaling picture
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parity, circuits, and the polynomial-time hierarchy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Natural proofs
- Random-energy model: an exactly solvable model of disordered systems
- A New Derivation of Stirling's Approximation to n!
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- Closing probabilities in the Kauffman model: An annealed computation
- Title not available (Why is that?)
- Boolean dynamics with random couplings
- The Power and Weakness of Randomness in Computation
- Numerical and theoretical studies of noise effects in the Kauffman model
- Relevant elements, magnetization and dynamical properties in Kauffman networks: A numerical study
- Reversible Boolean networks. I: Distribution of cycle lengths
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)