Counting Complexity by Using Partial Circuit Independency

This paper describes about complexity of NP problems by using “Effective circuit” independency, and apply SAT problem. Inputs of circuit family that compute P problem have some explicit symmetry that indicated circuit structure. To clarify this explict symmetry, we define “Effective circuit” as partial circuit which are necessary to compute target inputs. Effective circuit set divide problem to some symmetric partial problems. The other hand, inputs of NTM that compute NP problem have extra implicit symmetry that indicated nondeterministic transition functions. To clarify this implicit symmetry, we define special DTM “Concrete DTM”which index i correspond to selection of nondeterministic transition functions. That is, NTM split many different asymmetry DTM and compute all DTM in same time. Consider concrete DTM and effective circuit set, circuit family [SAT] that solve SAT problem have to include all effective circuit set [CVPi] that correspond to concrete DTM as Circuit Value Problem. [CVPi] have unique gate and [SAT] must include all [CVPi]. Number of [CVPi] is over polynomial size of input. Therefore, [SAT] is over polynomial size.