General Science and Philosophy

    

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

Authors: Koji Kobayashi

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.

Comments: 5 Pages.

Download: PDF

Submission history

[v1] 2014-02-09 06:35:13
[v2] 2014-02-10 11:11:43
[v3] 2014-02-11 06:16:13
[v4] 2014-02-13 11:53:38
[v5] 2014-02-15 03:04:03
[v6] 2014-02-16 01:41:39
[v7] 2014-02-18 11:40:39
[v8] 2014-02-19 11:25:30
[v9] 2014-02-20 11:28:10
[vA] 2014-02-23 07:10:30

Unique-IP document downloads: 850 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus