3 papers
cs.CC2015
SAT problem and statistical distance
Feng Pan
In this paper with two equivalent representations of the information contained by a SAT formula, the reason why string generated by succinct SAT formula can be greatly compressed i…
cs.CC2014
SAT is a problem with exponential complexity measured by negentropy
Feng Pan
In this paper the reason why entropy reduction (negentropy) can be used to measure the complexity of any computation was first elaborated both in the aspect of mathematics and info…
physics.data-an2014
The physical limit of logical compare operation
Feng Pan, Heng-Liang Zhang, Jie Qi
In this paper two connected Szilard single molecule engines (with different temperature) model of Maxwell's demon are used to demonstrate and analysis the logical compare operation…