Connection and Dispersion of Computation

Details Connection and Dispersion of Computation Connection and Dispersion of Computation

2011-06-27

arxiv.org/abs/1106.5470v9

Computer Science

Logic in Computer Science

Scientific paper

This paper talk about the influence of Connection and Dispersion on Computational Complexity. And talk about the HornCNF's connection and CNF's dispersion, and show the difference between CNFSAT and HornSAT. First, I talk the relation between MUC decision problem and classifying the truth value assignment. Second, I define the two inner products ("inner product" and "inner harmony") and talk about the influence of orthogonal and correlation to MUC. And we can not reduce MUC to Orthogonalization MUC by using HornMUC in polynomial size because HornMUC have high orthogonal of inner harmony and MUC do not. So DP is not P, and NP is not P.

Affiliated with

Also associated with

No associations

Rating

Connection and Dispersion of Computation 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 Connection and Dispersion of Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connection and Dispersion of Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-639095