Corpus ID: 14662286

Renormalization group approach to the P versus NP question

@article{Coppersmith2006RenormalizationGA,
  title={Renormalization group approach to the P versus NP question},
  author={S. Coppersmith},
  journal={ArXiv},
  year={2006},
  volume={abs/cs/0608053}
}
  • S. Coppersmith
  • Published 2006
  • Computer Science, Physics, Mathematics
  • ArXiv
  • This paper argues that the ideas underlying the renormalization group technique used to characterize phase transitions in condensed matter systems could be useful for distinguishing computational complexity classes. The paper presents a renormalization group transformation that maps an arbitrary Boolean function of $N$ Boolean variables to one of $N-1$ variables. When this transformation is applied repeatedly, the behavior of the resulting sequence of functions is different for a generic… CONTINUE READING

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 42 REFERENCES
    P, NP and mathematics a computational complexity perspective
    61
    On representations by low-degree polynomials
    59
    The history and status of the P versus NP question
    135
    The complexity of theorem-proving procedures
    • S. Cook
    • Mathematics, Computer Science
    • 1971
    4984
    Complexity of the predecessor problem in Kauffman networks.
    9
    Natural proofs
    245
    A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
    188
    Algebraic methods in the theory of lower bounds for Boolean circuit complexity
    709