Measuring Complexity by Using Reduction to Solve P vs NP and NC & PH

Koji Kobayashi · viXra · 2014

This article prove that NC and PH is proper (especially P is not NP) by using reduction difference. We can prove that NC is proper by using AL0 is not NC. This means L is not P. We can prove P is not NP by using reduction difference between L and P. And we can also prove that PH is proper by using P is not NP.

Read the paper · More papers on PaperTik