Computer Science – Computational Complexity
Scientific paper
2006-08-11
Computer Science
Computational Complexity
Original version had a conjecture that is known to be false. Revised version corrects this error
Scientific paper
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 Boolean function than for Boolean functions that can be written as a polynomial of degree $\xi$ with $\xi \ll N$ as well as for functions that depend on composite variables such as the arithmetic sum of the inputs. Being able to demonstrate that functions are non-generic is of interest because it suggests an avenue for constructing an algorithm capable of demonstrating that a given Boolean function cannot be computed using resources that are bounded by a polynomial of $N$.
No associations
LandOfFree
Renormalization group approach to the P versus NP question does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Renormalization group approach to the P versus NP question, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Renormalization group approach to the P versus NP question will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-546650