# 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} }

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

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 42 REFERENCES

Algebraic methods in the theory of lower bounds for Boolean circuit complexity

- Mathematics, Computer Science
- 1987

709