Koji Kobayashi

Counting Complexity by Using Partial Circuit Independency

2017 · viXra

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 …

Almost All Monotone Circuit Family

2018 · viXra

This paper describes about Almost all monotone circuit and introduce its interesting advantages to measuring problem complexity. Explained in Michael Sipser Introduction to the Theory of COMPUTATION, circuit family that emulate Deterministic Turing machine (DTM) …