Using the renormalization group to classify boolean functions

Journal of Statistical Physics

Volumn 130, Issue 6, 2008, Pages 1063-1085

  Coppersmith, S N ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Computational complexity; Renormalization group

Indexed keywords

EID: 39149141863     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10955-008-9486-2     Document Type: Article

References (52)

1. Aaronson, S.: Is P versus NP formally independent? Bull. Eur. Assoc. Theor. Comput. Sci. 81, 109 (2003)
2. Aldana, M., Coppersmith, S., Kadanoff, L.: Boolean dynamics with random couplings. In: Kaplan, E., Marsden, J., Sreenivasan, K. (eds.) Perspectives and Problems in Nonlinear Science. Springer Applied Mathematical Sciences Series. Springer, Berlin (2003)
3. Axelrod, R.: Advancing the art of simulation in the social sciences. In: Conte, R., Hegselmann, R., Terna, P. (eds.) Simulating Social Phenomena, pp. 21-40. Springer, Berlin (1997)
4. Bastolla, U., Parisi, G.: Closing probabilities in the Kauffman model: an annealed computation. Physica D 98, 1-25 (1996)
5. Bastolla, U., Parisi, G.: The modular structure of Kauffman networks. Physica D 115, 203-218, 219-233 (1998)
6. Bastolla, U., Parisi, G.: Relevant elements, magnetization and dynamical properties in Kauffman networks: a numerical study. Physica D 115, 203-218 (1998)
7. Bennett, C.: Logical depth and physical complexity. Oxford University Press, London (1988), pp. 227-257
8. A with probability 1. SIAM J. Comput. 10, 96-113 (1981)
9. Bhatt, R., Lee, P.: Scaling studies of highly disordered spin-1/2 antiferromagnetic systems. Phys. Rev. Lett. 48, 344-347 (1982)
10. Bhattacharjya, A., Liang, S.: Power-law distributions in some random Boolean networks. Phys. Rev. Lett. 77, 1644-1647 (1996)
11. Boppana, R., Sipser, M.: The complexity of finite functions. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 759-804. Elsevier, Amsterdam (1990)
12. Cook, S.: The complexity of theorem proving procedures. In: Third Annual ACM Symposium on the Theory of Computing, pp. 151-158. Assoc. Comput. Mach., New York (1971)
13. Coppersmith, S.: Complexity of the predecessor problem in Kauffman networks. Phys. Rev. E 75, 51108 (2007)
14. Coppersmith, S., Kadanoff, L.P., Zhang, Z.: Reversible Boolean networks I: Distribution of cycle lengths. Physica D 149, 11-29 (2001)
15. Derrida, B.: Random-energy model: An exactly solvable model of disordered systems. Phys. Rev. B 24, 2613-2626 (1981)
16. Derrida, B., Flyvbjerg, H.: The random map model: a disordered model with deterministic dynamics. J. Phys. 48, 971-978 (1987)
17. Derrida, B., Weisbuch, G.: Evolution of overlaps between configuration in random networks. J. Phys. (Paris) 47, 1297-1303 (1986)
18. Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17, 13-27 (1984)
19. Goldenfeld, N.: Lectures on Phase Transitions and the Renormalization Group. Perseus, New York (1992)
20. Goldreich, O.: Candidate one-way functions based on expander graphs (2000). Cryptology ePrint Archive, Report 200/063, available at http://www.wisdom/weizmann.ac.il/~oded/ow-candid.html
21. Håstad, J.: Almost optimal lower bounds for small depth circuits. In: Proc. 18th ACM Symp. on Theory of Computing, pp. 6-20 (1986)
22. Hurford, J.: Random Boolean nets and features of language. IEEE Trans. Evol. Comput. 5, 111-116 (2001)
23. Institute, C.M.: Clay Mathematics Institute Millennium Problems. http://www.claymath.org/millenium/
24. c. Physics 2, 263-272 (1966)
25. Kauffman, S.: Homeostasis and differentiation in random genetic control networks. Nature 244, 177-178 (1969)
26. Kauffman, S.: Metabolic stability and epigenesis in random constructed genetic nets. J. Theor. Biol. 22, 437-467 (1969)
27. Kauffman, S.: The large scale structure and dynamics of genetic control circuits: An ensemble approach. J. Theor. Biol. 44, 167-190 (1974)
28. Kauffman, S.: Emergent properties in random complex automata. Physica D 10, 145-156 (1984)
29. Kauffman, S.: The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, London (1993)
30. Kauffman, S.: At Home in the Universe: The Search for Laws of Self-Organization and Complexity. Oxford University Press, London (1995)
31. Levin, L.: Universal sorting problems. Probl. Pered. Inf. 9, 115-116 (1973) (in Russian). English translation: Universal search problems, in: Trakhtenbrot, B.A.: A survey of Russian approaches to Perebor (Brute-Force searches) algorithms. Ann. Hist. Comput. 6(4), 384-400 (1984)
32. Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, New York (1997)
33. Ma, S.K., Dasgupta, C., Hu, C.K.: Random antiferromagnetic chain. Phys. Rev. Lett. 43, 1434-1437 (1979)
34. Marsaglia, G., Marsaglia, J.: A new derivation of Stirling's approximation to n!. Am. Math. Mon. 97, 826-829 (1990)
35. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
36. Qu, X., Aldana, M., Kadanoff, L.: Numerical and theoretical studies of noise effects in the Kauffman model. J. Stat. Phys. 109, 967-985 (2002)
37. Raz, R.: Lecture notes on arithmetic circuits. http://www.cs.mcgill.ca/ ~denis/notes05.ps
38. Razborov, A.: Lower bounds on the size of bounded-depth networks over a complete basis with logical addition. Math. Notes Acad. Sci. USSR 41, 333-338 (1987)
39. Razborov, A., Rudich, S.: Natural proofs. In: Proc. 26th ACM Symp. on Theory of Computing, pp. 204-213 (1994)
40. Riordan, J., Shannon, C.: The number of two-terminal series-parallel networks. J. Math. Phys. 21, 83-93 (1942)
41. Shannon, C.: The synthesis of two-terminal switching circuits. Bell Syst. Tech. J. 28, 59-98 (1949)
42. Sipser, M.: The history and status of the P versus NP question. In: Proceedings of ACM STOC'92, pp. 603-618 (1992)
43. Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: STOC'87: Proc. of 19th STOC, pp. 77-82 (1987)
44. Smolensky, R.: On representations by low-degree polynomials. IEEE, pp. 130-138 (1993)
45. Socolar, J., Kauffman, S.: Scaling in ordered and critical random Boolean networks. Phys. Rev. Lett. 90, 068702 (2003)
46. Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, New York (1999)
47. Wegener, I.: The Complexity of Boolean Functions. Wiley, New York (1987). http://citeseer.ist.psu.edu/694854.html
48. White, S.: Density matrix formulation for quantum renormalization groups. Phys. Rev. Lett. 69, 2863-2866 (1992)
49. Wigderson, A.: P, NP and mathematics-a computational complexity perspective. In: Proceedings of the ICM 06 (2006). http://www.math.ias.edu/~avi/ PUBLICATIONS/MYPAPERS/W06/W06.pdf
50. Wilson, K.: The renormalization group and critical phenomena I: Renormalization group and the Kadanoff scaling picture. Phys. Rev. B 4, 3174-3183 (1971)
51. Wilson, K.: Problems in physics with many scales of length. Sci. Am. 241, 158-179 (1979)
52. Yao, A.: Separating the polynomial-time hierarchy by oracles. In: Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 1-10 (1985)